Zero-knowledge with finite state verifiers (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Finite state verifiers II: zero knowledge
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
How to simulate free will in a computational device
ACM Computing Surveys (CSUR)
Probabilistic rebound Turing machines
Theoretical Computer Science
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Space-Efficient 1.5-Way Quantum Turing Machine
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
On partially blind multihead finite automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On some variations of two-way probabilistic finite automata models
Theoretical Computer Science
Some Observations on Two-Way Finite Automata with Quantum and Classical States
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Information Sciences: an International Journal
A space lower bound of two-dimensional probabilistic turing machines
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Unbounded-error quantum computation with small space bounds
Information and Computation
UC'11 Proceedings of the 10th international conference on Unconventional computation
Journal of the ACM (JACM)
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Multiple usage of random bits in finite automata
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
Hi-index | 0.00 |