The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Information and Computation
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
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
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th 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
Capture Complexity by Partition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
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
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The language intersection problem for non-recursive context-free grammars
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On breakable cyclic definitions
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
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
Progress in computational complexity theory
Journal of Computer Science and Technology
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
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
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
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
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
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
DLT'10 Proceedings of the 14th 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
Correctness of linear logic proof structures is NL-complete
Theoretical Computer Science
Theoretical Computer Science
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
A note on algebras of languages
Theoretical Computer Science
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Cryptography in constant parallel time
Cryptography in constant parallel time
Model-checking hierarchical structures
Journal of Computer and System Sciences
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
Linearly bounded infinite graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On some transformation invariants under retiming and resynthesis
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Context-Sensitive decision problems in groups
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On the structure of linear apex NLC graph grammars
Theoretical Computer Science
An alternating hierarchy for finite automata
Theoretical Computer Science
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
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
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
ON GRAMMAR AND LANGUAGE FAMILIES
Fundamenta Informaticae
Correctness of multiplicative (and exponential) proof structures is NL-complete
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Extending inclusion dependencies with conditions
Theoretical Computer Science
On expressive power of regular realizability problems
Problems of Information Transmission
| Hi-index | 0.01 |