Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
ACM SIGACT News
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
Open questions in the theory of semifeasible computation
ACM SIGACT News
SIGACT news complexity theory column 64
ACM SIGACT News
Sparse selfreducible sets and polynomial size circuit lower bounds
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 5.23 |