Richard Cleve

	2012
41		Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita: Reconstructing Strings from Substrings with Quantum Queries CoRR abs/1204.4691: (2012)
	2009
40		Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo: Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC 2009: 409-416
39		Richard Cleve, Dmitry Gavinsky, Rahul Jain: Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Information & Computation 9(7): 648-656 (2009)
38		Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo: Discrete-Query Quantum Algorithm for NAND Trees. Theory of Computing 5(1): 119-123 (2009)
	2008
37		Richard Cleve, Dmitry Gavinsky, David L. Yonge-Mallo: Quantum Algorithms for Evaluating Min-MaxTrees. TQC 2008: 11-15
36		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
35		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
34		Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger: New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419
33		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)
	2005
32		Rolf T. Horn, A. J. Scott, Jonathan Walgate, Richard Cleve, A. I. Lvovsky, Barry C. Sanders: Classical and quantum fingerprinting with shared randomness and one-sided error. Quantum Information & Computation 5(3): 258-271 (2005)
	2004
31		Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous: Consequences and Limits of Nonlocal Strategies. IEEE Conference on Computational Complexity 2004: 236-249
30		Richard Cleve: The query complexity of order-finding. Inf. Comput. 192(2): 162-171 (2004)
	2003
29		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
28		Mark Adcock, Richard Cleve: A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS 2002: 323-334
27		J. Niel de Beaudrap, Richard Cleve, John Watrous: Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002)
26		Richard Cleve: Editorial. Quantum Information & Computation 2(7): 517 (2002)
	2001
25		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		Richard Cleve: The Query Complexity of Order-Finding. IEEE Conference on Computational Complexity 2000: 54-
22		Harry Buhrman, Richard Cleve, Wim van Dam: Quantum Entanglement and Communication Complexity. SIAM J. Comput. 30(6): 1829-1841 (2000)
	1999
21		Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka: Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368
20		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		Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361
18		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		Harry Buhrman, Richard Cleve, Avi Wigderson: Quantum vs. Classical Communication and Computation. STOC 1998: 63-68
16		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		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		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		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		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		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

Coauthor Index

1	Mark Adcock	[28] [33]
2	Robert Beals	[16] [19] [25]
3	J. Niel de Beaudrap	[27]
4	Michael Ben-Or	[2] [8]
5	Nader H. Bshouty	[7] [9] [11] [12] [13] [14] [15]
6	Harry Buhrman	[16] [17] [19] [20] [21] [22] [25] [34]
7	Andrew M. Childs	[29] [38]
8	Fan R. K. Chung (Fan Chung Graham)	[10]
9	Paul Dagum	[10]
10	Wim van Dam	[18] [22]
11	Enrico Deotto	[29]
12	Wayne Eberly (Wayne M. Eberly)	[7] [12]
13	Edward Farhi	[29]
14	François Le Gall (Francois Le Gall)	[41]
15	Ricard Gavaldà	[13] [14]
16	Dmitry Gavinsky	[37] [39]
17	Daniel Gottesman	[40]
18	Sam Gutmann	[29]
19	Rolf T. Horn	[32]
20	Peter Høyer	[31]
21	Kazuo Iwama	[33] [41]
22	Rahul Jain	[39]
23	Stephen P. Jordan	[38]
24	Sampath Kannan	[11] [13] [14]
25	Monique Laurent	[34]
26	Noah Linden	[34]
27	A. I. Lvovsky	[32]
28	Michele Mosca	[16] [19] [25] [40]
29	Michael Nielsen	[18]
30	Harumichi Nishimura	[41]
31	Raymond H. Putra (Rudy Raymond Harry Putra)	[33]
32	Barry C. Sanders	[32]
33	Alexander Schrijver	[34]
34	A. J. Scott	[32]
35	William Slofstra	[35] [36]
36	Rolando D. Somma	[40]
37	Daniel A. Spielman	[29]
38	Christino Tamon	[11] [13] [14]
39	Seiichiro Tani	[41]
40	Alain Tapp	[18]
41	Junichi Teruyama	[41]
42	Benjamin Toner	[31]
43	Falk Unger	[34] [35] [36]
44	Sarvagya Upadhyay	[35] [36]
45	Jonathan Walgate	[32]
46	John Watrous	[24] [27] [31]
47	Avi Wigderson	[17]
48	Ronald de Wolf	[16] [19] [20] [21] [25]
49	Shigeru Yamashita	[33] [41]
50	David L. Yonge-Mallo	[37] [38] [40]
51	Christof Zalka	[20] [21]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page