The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
IEEE Annals of the History of Computing - Special issue on Central and Eastern Europe
The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Information and Computation
SIGACT news complexity theory column 35
ACM SIGACT News
Alternating and Empty Alternating Auxiliary Stack Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
On the Minimal Polynomial of a Matrix
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A Perspective on Lindström Quantifiers and Oracles
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Space hierarchy theorem revised
Theoretical Computer Science - Mathematical foundations of computer science
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science - Mathematical foundations of computer science
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
The complexity of planarity testing
Information and Computation
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
SIGACT news complexity theory column 52
ACM SIGACT News
The complexity of membership problems for circuits over sets of integers
Theoretical Computer Science
Complementing two-way finite automata
Information and Computation
Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
The parallel complexity of finite-state automata problems
Information and Computation
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
On “inherently context-sensitive” languages - An application of complexity cores
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Algorithms and theory of computation handbook
Observations on complete sets between linear time and polynomial time
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A note on algebras of languages
Theoretical Computer Science
Model-checking hierarchical structures
Journal of Computer and System Sciences
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
An alternating hierarchy for finite automata
Theoretical Computer Science
Experimental descriptive complexity
Logic and Program Semantics
Descriptional complexity of pushdown store languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
ON GRAMMAR AND LANGUAGE FAMILIES
Fundamenta Informaticae
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
| Hi-index | 0.00 |