Information transfer under different sets of protocols
SIAM Journal on Computing
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A time-randomness tradeoff for communication complexity
Proceedings of the 4th international workshop on Distributed algorithms
Handbook of theoretical computer science (vol. A)
Private vs. common random bits in communication complexity
Information Processing Letters
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Path-bounded four-dimensional finite automata
ICOSSSE'10 Proceedings of the 9th WSEAS international conference on System science and simulation in engineering
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |