On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
| Hi-index | 0.00 |