There is No Recursive Axiomatization for Feasible Functionals of Type 2 - Anil Seth (LICS, 1992)

Some Desirable Conditions for Feasible Functionals of Type 2 - Anil Seth (LICS, 1993)

Type 2 Polynomial Hierarchies. - Anil Seth (LCC, 1994)

When Do Fixed Point Logics Capture Complexity Classes? - Anil Seth (LICS, 1995)

Sharper Results on the Expressive Power of Generalized Quantifiers. - Anil Seth (FSTTCS, 1997)

Ordering Finite Variable Types with Generalized Quantifiers. - Anuj Dawar; Lauri Hella; Anil Seth (LICS, 1998)

On Lk(Q) Types and Boundedness of IFP(Q) on Finite Structures. - Anil Seth (ASIAN, 1999)

Algorithms for energy optimization using processor instructions. - Anil Seth; Ravindra B. Keskar; R. Venugopal (CASES, 2001)

RAM Simulation of BGS Model of Abstract-state Machines. - Seshadhri Comandur; Anil Seth; Somenath Biswas (Fundam. Informaticae, 2007)

An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems. - Anil Seth (Int. J. Found. Comput. Sci., 2008)

Games on Multi-stack Pushdown Systems. - Anil Seth (LFCS, 2009)

Games on Higher Order Multi-stack Pushdown Systems. - Anil Seth (RP, 2009)

Global Reachability in Bounded Phase Multi-stack Pushdown Systems. - Anil Seth (CAV, 2010)

Game of Life. - Eugene M. Izhikevich; John H. Conway; Anil Seth (Scholarpedia, 2015)

Using Contour Trees in the Analysis and Visualization of Radio Astronomy Data Cubes. - Paul Rosen 001; Bei Wang 001; Anil Seth; Betsy Mills; Adam Ginsburg; Julia Kamenetzky; Jeff Kern; Chris R. Johnson 001 (CoRR, 2017)

Too many ghosts in the machine. - Anil Seth (Nat. Mach. Intell., 2019)