The communication complexity of pointer chasing: applications of entropy and sampling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |