Journal of the ACM (JACM)
Word Problems Solvable in Logspace
Journal of the ACM (JACM)
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Query Languages for Real Number Databases Based on Descriptive Complexity over R
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Space-bounded hierarchies and probabilistic computations
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Notes in Theoretical Computer Science (ENTCS)
A combinatorial algorithm for Pfaffians
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The complexity of model checking for intuitionistic logics and their modal companions
RP'10 Proceedings of the 4th international conference on Reachability problems
The lattice structure of sets of surjective hyper-operations
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The complexity of positive first-order logic without equality II: the four-element case
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.01 |