Fault-Tolerant Quantum Computation with Higher-Dimensional Systems. - Daniel Gottesman (QCQC, 1998)

A quantum analog of huffman coding. - Samuel L. Braunstein; Christopher A. Fuchs; Daniel Gottesman; Hoi-Kwong Lo (IEEE Trans. Inf. Theory, 2000)

Detectable byzantine agreement secure against faulty majorities. - Matthias Fitzi; Daniel Gottesman; Martin Hirt; Thomas Holenstein; Adam D. Smith 001 (PODC, 2002)

Secure multi-party quantum computation. - Claude Crépeau; Daniel Gottesman; Adam D. Smith 001 (STOC, 2002)

Authentication of Quantum Messages. - Howard Barnum; Claude Crépeau; Daniel Gottesman; Adam D. Smith 001; Alain Tapp (IACR Cryptol. ePrint Arch., 2002)

Book review: On "Introduction to Quantum Computation and Information" edited by Hoi-Kwong Lo, Sandu Popescu, and Tim Spiller. - Daniel Gottesman (Quantum Inf. Comput., 2002)

Uncloneable encryption. - Daniel Gottesman (Quantum Inf. Comput., 2003)

Proof of security of quantum key distribution with two-way classical communications. - Daniel Gottesman; Hoi-Kwong Lo (IEEE Trans. Inf. Theory, 2003)

Improved Simulation of Stabilizer Circuits - Scott Aaronson; Daniel Gottesman (CoRR, 2004)

Security of quantum key distribution with imperfect devices. - Daniel Gottesman; Hoi-Kwong Lo; Norbert Lütkenhaus; John Preskill (Quantum Inf. Comput., 2004)

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. - Claude Crépeau; Daniel Gottesman; Adam D. Smith 001 (EUROCRYPT, 2005)

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. - Michael Ben-Or; Claude Crépeau; Daniel Gottesman; Avinatan Hassidim; Adam D. Smith 001 (FOCS, 2006)

Quantum accuracy threshold for concatenated distance-3 codes. - Panos Aliferis; Daniel Gottesman; John Preskill (Quantum Inf. Comput., 2006)

The minimum distance problem for two-way entanglement purification. - Andris Ambainis; Daniel Gottesman (IEEE Trans. Inf. Theory, 2006)

The Power of Quantum Systems on a Line. - Dorit Aharonov; Daniel Gottesman; Sandy Irani; Julia Kempe (FOCS, 2007)

Accuracy threshold for postselected quantum computation. - Panos Aliferis; Daniel Gottesman; John Preskill (Quantum Inf. Comput., 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)

The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. - Daniel Gottesman; Sandy Irani (Theory Comput., 2013)

Fault-tolerant quantum computation with constant overhead. - Daniel Gottesman (Quantum Inf. Comput., 2014)

Streaming Universal Distortion-Free Entanglement Concentration. - Robin Blume-Kohout; Sarah Croke; Daniel Gottesman (IEEE Trans. Inf. Theory, 2014)

Quantum computing: Efficient fault tolerance. - Daniel Gottesman (Nat., 2016)

Technical perspective: Deciphering errors to reduce the cost of quantum computation. - Daniel Gottesman (Commun. ACM, 2021)

A Criterion for Quantum Advantage. - Chaitanya D. Karamchedu; Matthew Fox; Daniel Gottesman (CoRR, 2024)

Partial Syndrome Measurement for Hypergraph Product Codes. - Noah Berthusen; Daniel Gottesman (Quantum, 2024)

The Rotation-Invariant Hamiltonian Problem Is QMA_EXP-Complete. - Jon Nelson; Daniel Gottesman (TQC, 2025)