Anil Seth

According to our database1, Anil Seth authored at least 16 papers between 1992 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Too many ghosts in the machine.
Nat. Mach. Intell., 2019

2017
Using Contour Trees in the Analysis and Visualization of Radio Astronomy Data Cubes.
CoRR, 2017

2015
Game of Life.
Scholarpedia, 2015

2010
Global Reachability in Bounded Phase Multi-stack Pushdown Systems.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Games on Higher Order Multi-stack Pushdown Systems.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Games on Multi-stack Pushdown Systems.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

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

2007
RAM Simulation of BGS Model of Abstract-state Machines.
Fundam. Informaticae, 2007

2001
Algorithms for energy optimization using processor instructions.
Proceedings of the 2001 International Conference on Compilers, 2001

1999
On <i>L</i><sup><i>k</i></sup>(<i>Q</i>) Types and Boundedness of <i>IFP</i>(<i>Q</i>) on Finite Structures.
Proceedings of the Advances in Computing Science, 1999

1998
Ordering Finite Variable Types with Generalized Quantifiers.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Sharper Results on the Expressive Power of Generalized Quantifiers.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1995
When Do Fixed Point Logics Capture Complexity Classes?
Proceedings of the Proceedings, 1995

1994
Type 2 Polynomial Hierarchies.
Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1993
Some Desirable Conditions for Feasible Functionals of Type~2
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992
There is No Recursive Axiomatization for Feasible Functionals of Type~2
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992


  Loading...