Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Real-Time Simulation of Multihead Tape Units
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
On Almost Everywhere Complex Recursive Functions
Journal of the ACM (JACM)
STOC '77 Proceedings of the ninth 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
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
Formal languages and their relation to automata
Formal languages and their relation to automata
Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
ACM SIGACT News
Sparse sets and collapse of complexity classes
Information and Computation
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Space hierarchy theorem revised
Theoretical Computer Science - Mathematical foundations of computer science
Two tapes are better than one for nondeterministic machines
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
How to show something is not: Proofs in formal language and computability theory
SIGCSE '78 Proceedings of the ninth SIGCSE technical symposium on Computer science education
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
Languages to diagonalize against advice classes
Computational Complexity
A time lower bound for satisfiability
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
SIGACT news complexity theory column 52
ACM SIGACT News
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Recursive Padding Technique on Nondeterministic Cellular Automata
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Unconditional Lower Bounds against Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the complexity of unary tiling-recognizable picture languages
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A time hierarchy theorem for nondeterministic cellular automata
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.01 |