Author of the publication

One-way probabilistic reversible and quantum one-counter automata.

, , , and . Theor. Comput. Sci., 289 (2): 963-976 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

General Properties of Quantum Zero-Knowledge Proofs.. TCC, volume 4948 of Lecture Notes in Computer Science, page 107-124. Springer, (2008)Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 115-127. Springer, (2002)An Analysis of Absorbing Times of Quantum Walks., , and . UMC, volume 2509 of Lecture Notes in Computer Science, page 315-330. Springer, (2002)Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols, , , and . CoRR, (2010)Space-Efficient Error Reduction for Unitary Quantum Computations., , , , and . ICALP, volume 55 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Power of Quantum Computation with Few Clean Qubits., , , , , and . CoRR, (2015)Quantum measurements for hidden subgroup problems with optimal sample complexity., , and . Quantum Inf. Comput., 8 (3): 345-358 (2008)Exact Quantum Algorithms for the Leader Election Problem., , and . STACS, volume 3404 of Lecture Notes in Computer Science, page 581-592. Springer, (2005)Universal Test for Quantum One-Way Permutations., , , and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 839-850. Springer, (2004)Quantum versus Deterministic Counter Automata., , and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 584-594. Springer, (2002)