| 2007 |
|---|
| 11 | EE | Seshadhri Comandur,
Anil Seth,
Somenath Biswas:
RAM Simulation of BGS Model of Abstract-state Machines.
Fundam. Inform. 77(1-2): 175-185 (2007) |
| 2005 |
|---|
| 10 | EE | Seshadhri Comandur,
Anil Seth,
Somenath Biswas:
RAM Simulation of BGS Model of Abstract State Machines.
Abstract State Machines 2005: 377-386 |
| 2002 |
|---|
| 9 | | Manindra Agrawal,
Anil Seth:
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings
Springer 2002 |
| 2001 |
|---|
| 8 | EE | Anil Seth,
Ravindra B. Keskar,
R. Venugopal:
Algorithms for energy optimization using processor instructions.
CASES 2001: 195-202 |
| 1999 |
|---|
| 7 | EE | Anil Seth:
On Lk(Q) Types and Boundedness of IFP(Q) on Finite Structures.
ASIAN 1999: 334-346 |
| 1998 |
|---|
| 6 | | Anuj Dawar,
Lauri Hella,
Anil Seth:
Ordering Finite Variable Types with Generalized Quantifiers.
LICS 1998: 28-43 |
| 1997 |
|---|
| 5 | EE | Anil Seth:
Sharper Results on the Expressive Power of Generalized Quantifiers.
FSTTCS 1997: 200-219 |
| 1995 |
|---|
| 4 | | Anil Seth:
When Do Fixed Point Logics Capture Complexity Classes?
LICS 1995: 353-363 |
| 1994 |
|---|
| 3 | | Anil Seth:
Type 2 Polynomial Hierarchies.
LCC 1994: 269-280 |
| 1993 |
|---|
| 2 | | Anil Seth:
Some Desirable Conditions for Feasible Functionals of Type~2
LICS 1993: 320-331 |
| 1992 |
|---|
| 1 | | Anil Seth:
There is No Recursive Axiomatization for Feasible Functionals of Type~2
LICS 1992: 286-295 |
