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
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th 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
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
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
Hi-index | 0.00 |