Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Amplification of slight probabilistic advantage at absolutely no cost in space
Information Processing Letters
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
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
Tally Languages Accepted by Monte Carlo Pushdown Automata
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
On the Structure of Log-Space Probabilistic Complexity Classes
On the Structure of Log-Space Probabilistic Complexity Classes
Properties of Probabilistic Pushdown Automata
Properties of Probabilistic Pushdown Automata
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On probabilistic pushdown automata
Information and Computation
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
Although randomization is now a standard tool for the design of efficient algorithms or for building simpler systems, we are far from fully understanding the power of randomized computing. Hence it is advisable to study randomization for restricted models of computation.We followthis approach by investigating the power of randomization for pushdown automata.Our main results are as follows. First we show that deterministic pushdown automata are weaker than Las Vegas pushdown automata, which in turn are weaker than one-sided-error pushdown automata. Finally one-sided-error pushdown automata are weaker than (nondeterministic) pushdown automata.In contrast to many other fundamental models of computing there are no known methods of decreasing error probabilities.We show that such methods do not exist by constructing languages which are recognizable by one-sided-error pushdown automata with error probability 1/2, but not by one-sided-error pushdown automata with error probability p