Measure Theoretic Completeness Notions for the Exponential Time Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Quantitative Aspects of Speed-Up and Gap Phenomena
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Automatic forcing and genericity: on the diagonalization strength of finite automata
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quantitative aspects of speed-up and gap phenomena
Mathematical Structures in Computer Science
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hard instances of algorithms and proof systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 5.23 |