The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Komplexität von Entscheidungsproblemen, Ein Seminar
Komplexität von Entscheidungsproblemen, Ein Seminar
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Machine models and linear time complexity
ACM SIGACT News
How hard are n2-hard problems?
ACM SIGACT News
The quasilinear isomorphism challenge
ACM SIGACT News
Linear reductions of maximum matching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation
Deterministic versus nondeterministic time and lower bound problems
Journal of the ACM (JACM)
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
ACM SIGACT News
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Observations on complete sets between linear time and polynomial time
Information and Computation
On the parameterized complexity of exact satisfiability problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.03 |