The SCEAS System
| |||||||

## Search the dblp DataBase
John Watrous:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
**Consequences and Limits of Nonlocal Strategies.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:236-249 [Conf] - Chris Marriott, John Watrous
**Quantum Arthur-Merlin Games.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:275-285 [Conf] - John Watrous
**Arthur and Merlin in a Quantum World.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:161- [Conf] - John Watrous
**Relationships Between Quantum and Classical Space-Bounded Complexity Classes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:210-227 [Conf] - John Watrous
**Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:180-187 [Conf] - Richard Cleve, John Watrous
**Fast parallel circuits for the quantum Fourier transform.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:526-536 [Conf] - Attila Kondacs, John Watrous
**On the Power of Quantum Finite State Automata.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:66-75 [Conf] - John Watrous
**Succinct quantum proofs for properties of finite groups.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:537-546 [Conf] - John Watrous
**imits on the Power of Quantum Statistical Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:459-0 [Conf] - John Watrous
**On One-Dimensional Quantum Cellular Automata.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:528-537 [Conf] - John Watrous
**PSPACE Has Constant-Round Quantum Interactive Proof Systems.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:112-119 [Conf] - John Watrous
**On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:341-351 [Conf] - Heath Gerhardt, John Watrous
**Continuous-Time Quantum Walks on the Symmetric Group.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:290-301 [Conf] - Gus Gutoski, John Watrous
**Quantum Interactive Proofs with Competing Provers.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:605-616 [Conf] - Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous
**One-dimensional quantum walks.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:37-49 [Conf] - Alexei Kitaev, John Watrous
**Parallelization, amplification, and exponential time simulation of quantum interactive proof systems.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:608-617 [Conf] - John Watrous
**Quantum algorithms for solvable groups.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:60-67 [Conf] - John Watrous
**Zero-knowledge against quantum attacks.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:296-305 [Conf] - J. Niel de Beaudrap, Richard Cleve, John Watrous
**Sharp Quantum versus Classical Query Complexity Separations.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:4, pp:449-461 [Journal] - Chris Marriott, John Watrous
**Quantum Arthur-Merlin games.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:2, pp:122-152 [Journal] - John Watrous
**On the complexity of simulating space-bounded quantum computations.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2003, v:12, n:1-2, pp:48-84 [Journal] - John Watrous
**Succinct quantum proofs for properties of finite groups**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Bill Rosgen, John Watrous
**On the hardness of distinguishing mixed-state quantum computations**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - John Watrous
**Quantum simulations of classical random walks and undirected graph connectivity**[Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal] - John Watrous
**PSPACE has 2-round quantum interactive proof systems**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - John Watrous
**On quantum and classical space-bounded processes with algebraic transition amplitudes**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - Andris Ambainis, John Watrous
**Two-way finite automata with quantum and classical states**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - Eric Bach, Susan Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous
**One-dimensional quantum walks with absorbing boundaries.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:4, pp:562-592 [Journal] - John Watrous
**Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:2, pp:376-391 [Journal] - John Watrous
**Space-Bounded Quantum Complexity.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:59, n:2, pp:281-326 [Journal] - Andris Ambainis, John Watrous
**Two-way finite automata with quantum and classical state.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:287, n:1, pp:299-311 [Journal] - John Watrous
**PSPACE has constant-round quantum interactive proof systems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:292, n:3, pp:575-588 [Journal] - Gus Gutoski, John Watrous
**Toward a general theory of quantum games.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:565-574 [Conf] - Gus Gutoski, John Watrous
**Toward a general theory of quantum games**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Gus Gutoski, John Watrous
**Quantum Interactive Proofs with Competing Provers**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] **Parallel Approximation of Non-interactive Zero-sum Quantum Games.**[Citation Graph (, )][DBLP]**Two-Message Quantum Interactive Proofs Are in PSPACE.**[Citation Graph (, )][DBLP]**QIP = PSPACE.**[Citation Graph (, )][DBLP]**Quantum Arthur-Merlin Games**[Citation Graph (, )][DBLP]**Two-message quantum interactive proofs are in PSPACE**[Citation Graph (, )][DBLP]**Quantum interactive proofs with short messages**[Citation Graph (, )][DBLP]**Closed Timelike Curves Make Quantum and Classical Computing Equivalent.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |