On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups. - Jonathan Leake; Nisheeth K. Vishnoi (CoRR, 2020)

A Polynomial-Time Algorithm and Applications for Matrix Sampling from Harish-Chandra-Itzykson-Zuber Densities. - Jonathan Leake; Colin S. McSwiggen; Nisheeth K. Vishnoi (CoRR, 2020)

Capacity Lower Bounds via Productization. - Leonid Gurvits; Jonathan Leake (Electron. Colloquium Comput. Complex., 2020)

Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to Quantum inference and differential privacy. - Jonathan Leake; Colin S. McSwiggen; Nisheeth K. Vishnoi (STOC, 2021)

Optimization and Sampling Under Continuous Symmetry: Examples and Lie Theory. - Jonathan Leake; Nisheeth K. Vishnoi (CoRR, 2021)

Counting matchings via capacity-preserving operators. - Leonid Gurvits; Jonathan Leake (Comb. Probab. Comput., 2021)

Deterministic Approximation Algorithms for Volumes of Spectrahedra. - Mahmut Levent Dogan; Jonathan Leake; Mohan Ravichandran (CoRR, 2022)

On the Computability of Continuous Maximum Entropy Distributions with Applications. - Jonathan Leake; Nisheeth K. Vishnoi (SIAM J. Comput., 2022)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. - Leonid Gurvits; Nathan Klein; Jonathan Leake (Electron. Colloquium Comput. Complex., 2023)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences. - Jonathan Leake; Kasper Lindberg; Shayan Oveis Gharan (CoRR, 2025)