The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
John Watrous: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Chris Marriott, John Watrous
    Quantum Arthur-Merlin Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:275-285 [Conf]
  3. John Watrous
    Arthur and Merlin in a Quantum World. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:161- [Conf]
  4. 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]
  5. 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]
  6. Richard Cleve, John Watrous
    Fast parallel circuits for the quantum Fourier transform. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:526-536 [Conf]
  7. Attila Kondacs, John Watrous
    On the Power of Quantum Finite State Automata. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:66-75 [Conf]
  8. John Watrous
    Succinct quantum proofs for properties of finite groups. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:537-546 [Conf]
  9. John Watrous
    imits on the Power of Quantum Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:459-0 [Conf]
  10. John Watrous
    On One-Dimensional Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:528-537 [Conf]
  11. John Watrous
    PSPACE Has Constant-Round Quantum Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:112-119 [Conf]
  12. John Watrous
    On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:341-351 [Conf]
  13. Heath Gerhardt, John Watrous
    Continuous-Time Quantum Walks on the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:290-301 [Conf]
  14. Gus Gutoski, John Watrous
    Quantum Interactive Proofs with Competing Provers. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:605-616 [Conf]
  15. 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]
  16. 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]
  17. John Watrous
    Quantum algorithms for solvable groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:60-67 [Conf]
  18. John Watrous
    Zero-knowledge against quantum attacks. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:296-305 [Conf]
  19. 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]
  20. Chris Marriott, John Watrous
    Quantum Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:122-152 [Journal]
  21. 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]
  22. John Watrous
    Succinct quantum proofs for properties of finite groups [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  23. 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]
  24. John Watrous
    Quantum simulations of classical random walks and undirected graph connectivity [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  25. John Watrous
    PSPACE has 2-round quantum interactive proof systems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. John Watrous
    Space-Bounded Quantum Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:281-326 [Journal]
  31. 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]
  32. 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]
  33. Gus Gutoski, John Watrous
    Toward a general theory of quantum games. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:565-574 [Conf]
  34. Gus Gutoski, John Watrous
    Toward a general theory of quantum games [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Gus Gutoski, John Watrous
    Quantum Interactive Proofs with Competing Provers [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  36. Parallel Approximation of Non-interactive Zero-sum Quantum Games. [Citation Graph (, )][DBLP]


  37. Two-Message Quantum Interactive Proofs Are in PSPACE. [Citation Graph (, )][DBLP]


  38. QIP = PSPACE. [Citation Graph (, )][DBLP]


  39. Quantum Arthur-Merlin Games [Citation Graph (, )][DBLP]


  40. Two-message quantum interactive proofs are in PSPACE [Citation Graph (, )][DBLP]


  41. Quantum interactive proofs with short messages [Citation Graph (, )][DBLP]


  42. Closed Timelike Curves Make Quantum and Classical Computing Equivalent. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002