STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
ACM SIGACT News
Partial Information and Special Case Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Comparing Verboseness for Finite Automata and Turing Machines
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
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Query complexity of membership comparable sets
Theoretical Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Open questions in the theory of semifeasible computation
ACM SIGACT News
SIGACT news complexity theory column 64
ACM SIGACT News
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Sparse selfreducible sets and polynomial size circuit lower bounds
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
Hi-index | 0.00 |