The SCEAS System
| |||||||

## Search the dblp DataBase
Richard Cleve:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
**Oracles and Queries That Are Sufficient for Exact Learning.**[Citation Graph (1, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:52, n:3, pp:421-433 [Journal] - Richard Cleve
**The Query Complexity of Order-Finding.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:54-0 [Conf] - 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] - Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
**Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).**[Citation Graph (0, 0)][DBLP] COLT, 1994, pp:130-139 [Conf] - Richard Cleve
**Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1989, pp:573-588 [Conf] - Richard Cleve
**Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1990, pp:530-544 [Conf] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum Lower Bounds by Polynomials.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:352-361 [Conf] - Nader H. Bshouty, Richard Cleve
**On the Exact Learning of Formulas in Parallel (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:513-522 [Conf] - Nader H. Bshouty, Richard Cleve, Wayne Eberly
**Size-Depth Tradeoffs for Algebraic Formulae**[Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:334-341 [Conf] - Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
**Bounds for Small-Error and Zero-Error Quantum Algorithms.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:358-368 [Conf] - Richard Cleve, John Watrous
**Fast parallel circuits for the quantum Fourier transform.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:526-536 [Conf] - Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
**New Limits on Fault-Tolerant Quantum Computation.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:411-419 [Conf] - Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
**Quantum Entanglement and the Communication Complexity of the Inner Product Function.**[Citation Graph (0, 0)][DBLP] QCQC, 1998, pp:61-74 [Conf] - Mark Adcock, Richard Cleve
**A Quantum Goldreich-Levin Theorem with Cryptographic Applications.**[Citation Graph (0, 0)][DBLP] STACS, 2002, pp:323-334 [Conf] - Michael Ben-Or, Richard Cleve
**Computing Algebraic Formulas Using a Constant Number of Registers**[Citation Graph (0, 0)][DBLP] STOC, 1988, pp:254-257 [Conf] - Harry Buhrman, Richard Cleve, Avi Wigderson
**Quantum vs. Classical Communication and Computation.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:63-68 [Conf] - Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
**Exponential algorithmic speedup by a quantum walk.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:59-68 [Conf] - Richard Cleve
**Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1986, pp:364-369 [Conf] - Richard Cleve
**Towards Optimal Simulations of Formulas by Bounded-Width Programs**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:271-277 [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] - Richard Cleve
**Towards Optimal Simulations of Formulas by Bounded-Width Programs.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1991, v:1, n:, pp:91-105 [Journal] - Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
**Bounds for Small-Error and Zero-Error Quantum Algorithms**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum Lower Bounds by Polynomials**[Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal] - Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
**Oracles and Queries That Are Sufficient for Exact Learning**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:15, pp:- [Journal] - Richard Cleve
**The query complexity of order-finding.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:192, n:2, pp:162-171 [Journal] - Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita
**Quantum lower bounds for the Goldreich-Levin problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:5, pp:208-211 [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum lower bounds by polynomials.**[Citation Graph (0, 0)][DBLP] J. ACM, 2001, v:48, n:4, pp:778-797 [Journal] - Fan R. K. Chung, Richard Cleve, Paul Dagum
**A Note on Constructive Lower Bounds for the Ramsey Numbers**[Citation Graph (0, 0)][DBLP]*R*(3,*t*). J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:150-155 [Journal] - Michael Ben-Or, Richard Cleve
**Computing Algebraic Formulas Using a Constant Number of Registers.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:1, pp:54-58 [Journal] - Nader H. Bshouty, Richard Cleve
**Interpolating Arithmetic Read-Once Formulas in Parallel.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:2, pp:401-413 [Journal] - Nader H. Bshouty, Richard Cleve, Wayne Eberly
**Size-Depth Tradeoffs for Algebraic Formulas.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:4, pp:682-705 [Journal] - Harry Buhrman, Richard Cleve, Wim van Dam
**Quantum Entanglement and Communication Complexity.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:1829-1841 [Journal] - Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
**Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:109-114 [Conf] **Efficient discrete-time simulations of continuous-time quantum query algorithms.**[Citation Graph (, )][DBLP]**Quantum Algorithms for Evaluating Min-MaxTrees.**[Citation Graph (, )][DBLP]**Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

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