Double-Lattice Packings of Convex Bodies in the Plane. - Greg Kuperberg; Wlodzimierz Kuperberg (Discret. Comput. Geom., 1990)

Self-complementary Plane Partitions by Proctor's Minuscule Method. - Greg Kuperberg (Eur. J. Comb., 1994)

Symmetries of Plane Partitions and the Permanent - Determinant Method. - Greg Kuperberg (J. Comb. Theory A, 1994)

Asymptotically Optimal Covering Designs. - Daniel M. Gordon; Oren Patashnik; Greg Kuperberg; Joel Spencer (J. Comb. Theory A, 1996)

Four Symmetry Classes of Plane Partitions under One Roof. - Greg Kuperberg (J. Comb. Theory A, 1996)

An Exploration of the Permanent-Determinant Method. - Greg Kuperberg (Electron. J. Comb., 1998)

Kasteleyn Cokernels. - Greg Kuperberg (Electron. J. Comb., 2002)

The capacity of hybrid quantum memory. - Greg Kuperberg (IEEE Trans. Inf. Theory, 2003)

Special moments. - Greg Kuperberg (Adv. Appl. Math., 2005)

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. - Greg Kuperberg (SIAM J. Comput., 2005)

Quantum Versus Classical Proofs and Advice. - Scott Aaronson; Greg Kuperberg (Electron. Colloquium Comput. Complex., 2006)

Numerical Cubature Using Error-Correcting Codes. - Greg Kuperberg (SIAM J. Numer. Anal., 2006)

Numerical Cubature from Archimedes' Hat-box Theorem. - Greg Kuperberg (SIAM J. Numer. Anal., 2006)

Knottedness is in NP, modulo GRH - Greg Kuperberg (CoRR, 2011)

Probabilistic existence of rigid combinatorial structures. - Greg Kuperberg; Shachar Lovett; Ron Peled (Electron. Colloquium Comput. Complex., 2011)

Norms as a Function of p Are Linearly Independent in Finite Dimensions. - Greg Kuperberg (Am. Math. Mon., 2012)

On the Power of a Unique Quantum Witness. - Rahul Jain 001; Iordanis Kerenidis; Greg Kuperberg; Miklos Santha; Or Sattath; Shengyu Zhang 002 (Theory Comput., 2012)

Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. - Greg Kuperberg (TQC, 2013)

Probabilistic existence of regular combinatorial structures - Greg Kuperberg; Shachar Lovett; Ron Peled (CoRR, 2013)

How Hard Is It to Approximate the Jones Polynomial? - Greg Kuperberg (Theory Comput., 2015)

The computational complexity of ball permutations. - Scott Aaronson; Adam Bouland; Greg Kuperberg; Saeed Mehraban (STOC, 2017)

Computational complexity and 3-manifolds and zombies. - Greg Kuperberg; Eric Samperton (CoRR, 2017)

Coloring invariants of knots and links are often intractable. - Greg Kuperberg; Eric Samperton (CoRR, 2019)

Breaking the cubic barrier in the Solovay-Kitaev algorithm. - Greg Kuperberg (CoRR, 2023)

The hidden subgroup problem for infinite groups. - Greg Kuperberg (CoRR, 2025)