A Power Law for the Distortion of Planar Sets. - Michael H. Freedman (Discret. Comput. Geom., 1987)

K-sat on Groups and Undecidability. - Michael H. Freedman (STOC, 1998)

Limit, logic, and computation. - Michael H. Freedman (Proc. Natl. Acad. Sci. USA, 1998)

P/NP, and the quantum field computer. - Michael H. Freedman (Proc. Natl. Acad. Sci. USA, 1998)

Quantum Computation and the Localization of Modular Functors. - Michael H. Freedman (Found. Comput. Math., 2001)

Projective Plane and Planar Quantum Codes. - Michael H. Freedman; David A. Meyer 001 (Found. Comput. Math., 2001)

Poly-Locality in Quantum Computing. - Michael H. Freedman (Found. Comput. Math., 2002)

Complexity Classes as Mathematical Axioms - Michael H. Freedman (CoRR, 2008)

Approximate Counting and Quantum Computation - Magnus Bordewich; Michael H. Freedman; László Lovász 001; D. Welsh (CoRR, 2009)

Complexity Classes as Mathematical Axioms II - Shawn X. Cui; Michael H. Freedman; Zhenghan Wang (CoRR, 2013)

Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs. - Michael H. Freedman; Matthew B. Hastings (Quantum Inf. Comput., 2014)

Faster phase estimation. - Krysta M. Svore; Matthew B. Hastings; Michael H. Freedman (Quantum Inf. Comput., 2014)

Quantum Max-flow/Min-cut. - Shawn X. Cui; Michael H. Freedman; Or Sattath; Richard Stong; Greg Minton (CoRR, 2015)

Predicting human-generated bitstreams using classical and quantum models. - Alex Bocharov; Michael H. Freedman; Eshan Kemp; Martin Roetteler; Krysta M. Svore (CoRR, 2020)

Symmetry Protected Quantum Computation. - Michael H. Freedman; Matthew B. Hastings; Modjtaba Shokrian Zini (Quantum, 2021)

Universality in long-distance geometry and quantum complexity. - Adam R. Brown; Michael H. Freedman; Henry W. Lin; Leonard Susskind (Nat., 2023)

The Proof of Kolmogorov-Arnold May Illuminate Neural Network Learning. - Michael H. Freedman (CoRR, 2024)

Adversarial KA. - Sviatoslav Dzhenzher; Michael H. Freedman (CoRR, 2025)