Measure Theoretic Completeness Notions for the Exponential Time Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Global Power of Additional Queries to p-Random Oracles
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Bi-Immunity Separates Strong NP-Completeness Notions
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Theoretical Computer Science
Bi-immunity separates strong NP-completeness notions
Information and Computation
Theoretical Computer Science
A note on dimensions of polynomial size circuits
Theoretical Computer Science
Comparing reductions to NP-complete sets
Information and Computation
Turing's unpublished algorithm for normal numbers
Theoretical Computer Science
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Functions that preserve p-randomness
Information and Computation
| Hi-index | 5.23 |