Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds on the length of universal traversal sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
SIGACT news complexity theory column 35
ACM SIGACT News
Theoretical Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Undirected connectivity in log-space
Journal of the ACM (JACM)
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Tradeoff lower lounds for stack machines
Computational Complexity
| Hi-index | 0.00 |