| Publication | Date of Publication | Type |
|---|
| Sampling arborescences in parallel | 2026-04-15 | Paper |
Optimal sublinear sampling of spanning trees and determinantal point processes via average-case entropic independence
SIAM Journal on Computing | 2025-10-24 | Paper |
A tight analysis of Bethe approximation for permanent
SIAM Journal on Computing | 2025-09-16 | Paper |
| Optimal sublinear sampling of spanning trees and determinantal point processes via average-case entropic independence | 2025-08-15 | Paper |
| Isotropy and log-concave polynomials: accelerated sampling and high-precision counting of matroid bases | 2025-08-12 | Paper |
| Spectral independence in high-dimensional expanders and applications to the hardcore model | 2025-08-12 | Paper |
| A tight analysis of Bethe approximation for permanent | 2025-08-12 | Paper |
| Planar graph perfect matching is in NC | 2025-08-12 | Paper |
| Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids | 2025-08-12 | Paper |
| Simply exponential approximation of the permanent of positive semidefinite matrices | 2025-08-06 | Paper |
| Effective-resistance-reducing flows, spectrally thin trees, and asymmetric TSP | 2025-08-05 | Paper |
| Mechanism design for crowdsourcing: an optimal 1-1/e competitive budget-feasible mechanism for large markets | 2025-08-05 | Paper |
| Universality of spectral independence with applications to fast mixing in spin glasses | 2024-11-28 | Paper |
| Parallel discrete sampling via continuous walks | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829237 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
Annals of Mathematics. Second Series | 2024-01-02 | Paper |
Entropic independence: optimal mixing of down-up random walks
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Log-concave polynomials in theory and applications (tutorial)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758358 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
| Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses | 2023-07-19 | Paper |
Matching Is as Easy as the Decision Problem, in the NC Model
(available as arXiv preprint) | 2023-02-03 | Paper |
Structured Robust Submodular Maximization: Offline and Online Algorithms
INFORMS Journal on Computing | 2022-06-28 | Paper |
| Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence | 2022-04-06 | Paper |
A Tight Analysis of Bethe Approximation for Permanent
SIAM Journal on Computing | 2022-01-07 | Paper |
Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
Duke Mathematical Journal | 2021-12-13 | Paper |
| Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities | 2021-11-05 | Paper |
Spectral independence in high-dimensional expanders and applications to the hardcore model
SIAM Journal on Computing | 2021-08-06 | Paper |
Graph Clustering using Effective Resistance
(available as arXiv preprint) | 2021-06-15 | Paper |
| Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models | 2021-06-08 | Paper |
A generalization of permanent inequalities and applications in counting and optimization
Advances in Mathematics | 2021-04-23 | Paper |
| Sampling Arborescences in Parallel | 2020-12-17 | Paper |
Planar graph perfect matching is in NC
Journal of the ACM | 2020-11-11 | Paper |
Budget feasible procurement auctions
Operations Research | 2020-10-12 | Paper |
Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids | 2018-11-05 | Paper |
Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids
(available as arXiv preprint) | 2018-07-02 | Paper |
Nash social welfare, matrix permanent, and stable polynomials
(available as arXiv preprint) | 2018-05-03 | Paper |
Approximating the largest root and applications to interlacing families
(available as arXiv preprint) | 2018-03-15 | Paper |
| Approximating the largest root and applications to interlacing families | 2018-03-15 | Paper |
Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
(available as arXiv preprint) | 2018-03-15 | Paper |
| Nash social welfare for indivisible items under separable, piecewise-linear concave utilities | 2018-03-15 | Paper |
A generalization of permanent inequalities and applications in counting and optimization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices | 2017-04-11 | Paper |
Euclidean movement minimization
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
| Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes | 2016-02-16 | Paper |
| The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP | 2014-12-02 | Paper |
