2008 | ||
---|---|---|
35 | EE | Richard Cleve, Dmitry Gavinsky, D. L. Yonge-Mallo: Quantum Algorithms for Evaluating Min-MaxTrees. TQC 2008: 11-15 |
34 | EE | Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay: Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Computational Complexity 17(2): 282-299 (2008) |
2007 | ||
33 | EE | Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay: Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. IEEE Conference on Computational Complexity 2007: 109-114 |
2006 | ||
32 | EE | Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger: New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 |
31 | EE | Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita: Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006) |
2004 | ||
30 | EE | Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous: Consequences and Limits of Nonlocal Strategies. IEEE Conference on Computational Complexity 2004: 236-249 |
29 | EE | Richard Cleve: The query complexity of order-finding. Inf. Comput. 192(2): 162-171 (2004) |
2003 | ||
28 | EE | Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman: Exponential algorithmic speedup by a quantum walk. STOC 2003: 59-68 |
2002 | ||
27 | EE | Mark Adcock, Richard Cleve: A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS 2002: 323-334 |
26 | EE | J. Niel de Beaudrap, Richard Cleve, John Watrous: Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002) |
2001 | ||
25 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001) |
2000 | ||
24 | Richard Cleve, John Watrous: Fast parallel circuits for the quantum Fourier transform. FOCS 2000: 526-536 | |
23 | EE | Richard Cleve: The Query Complexity of Order-Finding. IEEE Conference on Computational Complexity 2000: 54- |
22 | EE | Harry Buhrman, Richard Cleve, Wim van Dam: Quantum Entanglement and Communication Complexity. SIAM J. Comput. 30(6): 1829-1841 (2000) |
1999 | ||
21 | EE | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka: Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368 |
20 | EE | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka: Bounds for Small-Error and Zero-Error Quantum Algorithms CoRR cs.CC/9904019: (1999) |
1998 | ||
19 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 |
18 | EE | Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp: Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC 1998: 61-74 |
17 | EE | Harry Buhrman, Richard Cleve, Avi Wigderson: Quantum vs. Classical Communication and Computation. STOC 1998: 63-68 |
16 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum Lower Bounds by Polynomials CoRR quant-ph/9802049: (1998) |
15 | Nader H. Bshouty, Richard Cleve: Interpolating Arithmetic Read-Once Formulas in Parallel. SIAM J. Comput. 27(2): 401-413 (1998) | |
1996 | ||
14 | Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon: Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. 52(3): 421-433 (1996) | |
1995 | ||
13 | EE | Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon: Oracles and Queries That Are Sufficient for Exact Learning Electronic Colloquium on Computational Complexity (ECCC) 2(15): (1995) |
12 | Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995) | |
1994 | ||
11 | EE | Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon: Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT 1994: 130-139 |
1993 | ||
10 | EE | Fan R. K. Chung, Richard Cleve, Paul Dagum: A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t). J. Comb. Theory, Ser. B 57(1): 150-155 (1993) |
1992 | ||
9 | Nader H. Bshouty, Richard Cleve: On the Exact Learning of Formulas in Parallel (Extended Abstract) FOCS 1992: 513-522 | |
8 | Michael Ben-Or, Richard Cleve: Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1): 54-58 (1992) | |
1991 | ||
7 | Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulae FOCS 1991: 334-341 | |
6 | Richard Cleve: Towards Optimal Simulations of Formulas by Bounded-Width Programs. Computational Complexity 1: 91-105 (1991) | |
1990 | ||
5 | EE | Richard Cleve: Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. CRYPTO 1990: 530-544 |
4 | Richard Cleve: Towards Optimal Simulations of Formulas by Bounded-Width Programs STOC 1990: 271-277 | |
1989 | ||
3 | EE | Richard Cleve: Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. CRYPTO 1989: 573-588 |
1988 | ||
2 | Michael Ben-Or, Richard Cleve: Computing Algebraic Formulas Using a Constant Number of Registers STOC 1988: 254-257 | |
1986 | ||
1 | Richard Cleve: Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) STOC 1986: 364-369 |