Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) - Richard Cleve (STOC, 1986)

Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. - Richard Cleve (CRYPTO, 1989)

Methodologies for designing block ciphers and cryptographic protocols. - Richard Cleve (1989)

Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. - Richard Cleve (CRYPTO, 1990)

Size-Depth Tradeoffs for Algebraic Formulae - Nader H. Bshouty; Richard Cleve; Wayne Eberly (FOCS, 1991)

Towards Optimal Simulations of Formulas by Bounded-Width Programs. - Richard Cleve (Comput. Complex., 1991)

On the Exact Learning of Formulas in Parallel (Extended Abstract) - Nader H. Bshouty; Richard Cleve (FOCS, 1992)

Computing Algebraic Formulas Using a Constant Number of Registers. - Michael Ben-Or; Richard Cleve (SIAM J. Comput., 1992)

A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t). - Fan R. K. Chung; Richard Cleve; Paul Dagum (J. Comb. Theory B, 1993)

Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). - Nader H. Bshouty; Richard Cleve; Sampath Kannan; Christino Tamon (COLT, 1994)

Size-Depth Tradeoffs for Algebraic Formulas. - Nader H. Bshouty; Richard Cleve; Wayne Eberly (SIAM J. Comput., 1995)

Oracles and Queries That Are Sufficient for Exact Learning. - Nader H. Bshouty; Richard Cleve; Ricard Gavaldà; Sampath Kannan; Christino Tamon (J. Comput. Syst. Sci., 1996)

Quantum vs. Classical Communication and Computation. - Harry Buhrman; Richard Cleve; Avi Wigderson (STOC, 1998)

On quantum algorithms. - Richard Cleve; Artur Ekert; Leah Henderson; Chiara Macchiavello; Michele Mosca (Complex., 1998)

Interpolating Arithmetic Read-Once Formulas in Parallel. - Nader H. Bshouty; Richard Cleve (SIAM J. Comput., 1998)

Bounds for Small-Error and Zero-Error Quantum Algorithms. - Harry Buhrman; Richard Cleve; Ronald de Wolf; Christof Zalka (FOCS, 1999)

Fast parallel circuits for the quantum Fourier transform. - Richard Cleve; John Watrous (FOCS, 2000)

Quantum Entanglement and Communication Complexity. - Harry Buhrman; Richard Cleve; Wim van Dam (SIAM J. Comput., 2000)

Quantum lower bounds by polynomials. - Robert Beals; Harry Buhrman; Richard Cleve; Michele Mosca; Ronald de Wolf (J. ACM, 2001)

A Quantum Goldreich-Levin Theorem with Cryptographic Applications. - Mark Adcock; Richard Cleve (STACS, 2002)

Sharp Quantum versus Classical Query Complexity Separations. - J. Niel de Beaudrap; Richard Cleve; John Watrous (Algorithmica, 2002)

Editorial. - Richard Cleve (Quantum Inf. Comput., 2002)

Exponential algorithmic speedup by a quantum walk. - Andrew M. Childs; Richard Cleve; Enrico Deotto; Edward Farhi; Sam Gutmann; Daniel A. Spielman (STOC, 2003)

Consequences and Limits of Nonlocal Strategies. - Richard Cleve; Peter Høyer; Benjamin Toner; John Watrous (CCC, 2004)

The query complexity of order-finding. - Richard Cleve (Inf. Comput., 2004)

Classical and quantum fingerprinting with shared randomness and one-sided error. - Rolf T. Horn; A. J. Scott; Jonathan Walgate; Richard Cleve; A. I. Lvovsky 001; Barry C. Sanders (Quantum Inf. Comput., 2005)

New Limits on Fault-Tolerant Quantum Computation. - Harry Buhrman; Richard Cleve; Monique Laurent; Noah Linden; Alexander Schrijver; Falk Unger (FOCS, 2006)

Quantum lower bounds for the Goldreich-Levin problem. - Mark Adcock; Richard Cleve; Kazuo Iwama; Raymond H. Putra; Shigeru Yamashita (Inf. Process. Lett., 2006)

Quantum Algorithms for Evaluating Min-MaxTrees. - Richard Cleve; Dmitry Gavinsky; David L. Yonge-Mallo (TQC, 2008)

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. - Richard Cleve; William Slofstra; Falk Unger; Sarvagya Upadhyay (Comput. Complex., 2008)

Efficient discrete-time simulations of continuous-time quantum query algorithms. - Richard Cleve; Daniel Gottesman; Michele Mosca; Rolando D. Somma; David L. Yonge-Mallo (STOC, 2009)

Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. - Richard Cleve; Dmitry Gavinsky; Rahul Jain 001 (Quantum Inf. Comput., 2009)

Discrete-Query Quantum Algorithm for NAND Trees. - Andrew M. Childs; Richard Cleve; Stephen P. Jordan; David L. Yonge-Mallo (Theory Comput., 2009)

Reconstructing Strings from Substrings with Quantum Queries. - Richard Cleve; Kazuo Iwama; François Le Gall; Harumichi Nishimura; Seiichiro Tani; Junichi Teruyama; Shigeru Yamashita (SWAT, 2012)

Quantum entanglement and the communication complexity of the inner product function. - Richard Cleve; Wim van Dam; Michael Nielsen 002; Alain Tapp (Theor. Comput. Sci., 2013)

Characterization of Binary Constraint System Games. - Richard Cleve; Rajat Mittal 001 (ICALP (1), 2014)

Exponential improvement in precision for simulating sparse Hamiltonians. - Dominic W. Berry; Andrew M. Childs; Richard Cleve; Robin Kothari; Rolando D. Somma (STOC, 2014)

Computing with a full memory: Catalytic space. - Harry Buhrman; Richard Cleve; Michal Koucký 001; Bruno Loff; Florian Speelman (Electron. Colloquium Comput. Complex., 2014)

Gate-efficient discrete simulations of continuous-time quantum query algorithms. - Dominic W. Berry; Richard Cleve; Sevag Gharibian (Quantum Inf. Comput., 2014)

Near-linear constructions of exact unitary 2-designs. - Richard Cleve; Debbie W. Leung; Li Liu; Chunhao Wang (Quantum Inf. Comput., 2016)

Efficient Quantum Algorithms for Simulating Lindblad Evolution. - Richard Cleve; Chunhao Wang (ICALP, 2017)

Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement. - Richard Cleve; Benoit Collins; Li Liu; Vern I. Paulsen (Quantum, 2022)

Linear gate bounds against natural functions for position-verification. - Vahid R. Asadi; Richard Cleve; Eric Culf; Alex May 003 (Quantum, 2025)