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
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Bi-immunity separates strong NP-completeness notions
Information and Computation
Theoretical Computer Science
Theoretical Computer Science
SIGACT news complexity theory column 48
ACM SIGACT News
Reductions between disjoint NP-pairs
Information and Computation
Comparing reductions to NP-complete sets
Information and Computation
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Martingale families and dimension in P
Theoretical Computer Science
Two open problems on effective dimension
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
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
| Hi-index | 5.23 |