A lower bound for probabilistic algorithms for finite state machines
Journal of Computer and System Sciences
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Minimal nontrivial space complexity of probabilistic one-way turing machines
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Probabilistic Two-Way Machines
Proceedings on Mathematical Foundations of Computer Science
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
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
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational models of games
| Hi-index | 0.00 |