| Publication | Date of Publication | Type |
|---|
Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to quantum inference and differential privacy
Random Structures & Algorithms | 2025-10-14 | Paper |
| Faster polytope rounding, sampling, and volume computation via a sub-linear ball walk | 2025-08-12 | Paper |
| Subdeterminant maximization via nonconvex relaxations and anti-concentration | 2025-08-06 | Paper |
| Algorithms in the presence of biased inputs (invited talk) | 2025-07-28 | Paper |
Private low-rank approximation for covariance matrices, Dyson Brownian motion, and eigenvalue-gap bounds for Gaussian perturbations
Journal of the ACM | 2025-06-27 | Paper |
| A permanent approach to the traveling salesman problem | 2025-05-05 | Paper |
Sampling matrices from Harish-Chandra–Itzykson–Zuber densities with applications to Quantum inference and differential privacy
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
On the computability of continuous maximum entropy distributions with applications
SIAM Journal on Computing | 2022-11-15 | Paper |
| Private Matrix Approximation and Geometry of Unitary Orbits | 2022-07-06 | Paper |
Iteratively reweighted least squares and slime mold dynamics: connection and convergence
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
| Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk | 2022-06-19 | Paper |
| Sampling from Log-Concave Distributions with Infinity-Distance Guarantees | 2021-11-07 | Paper |
| An Introduction to Hamiltonian Monte Carlo Method for Sampling | 2021-08-26 | Paper |
On the number of circuits in regular matroids (with connections to lattices and codes)
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
On geodesically convex formulations for the Brascamp-Lieb constant
(available as arXiv preprint) | 2021-08-04 | Paper |
On the complexity of constrained determinantal point processes
(available as arXiv preprint) | 2021-07-28 | Paper |
Ranking with Fairness Constraints
(available as arXiv preprint) | 2021-07-28 | Paper |
| Isolating a vertex via lattices: polytopes with totally unimodular faces | 2021-07-28 | Paper |
| Algorithms for convex optimization | 2021-06-28 | Paper |
Dynamic Sampling from Graphical Models
SIAM Journal on Computing | 2021-04-14 | Paper |
Isolating a vertex via lattices: polytopes with totally unimodular faces
SIAM Journal on Computing | 2021-04-14 | Paper |
On the computability of continuous maximum entropy distributions with applications
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Subdeterminant maximization via nonconvex relaxations and anti-concentration
SIAM Journal on Computing | 2021-01-13 | Paper |
Dynamic sampling from graphical models
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
On the number of circuits in regular matroids (with connections to lattices and codes)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Belief Propagation, Bethe Approximation and Polynomials
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Faster polytope rounding, sampling, and volume computation via a sublinear "Ball Walk" | 2019-05-05 | Paper |
| Nonconvex sampling with the Metropolis-adjusted Langevin algorithm | 2019-02-22 | Paper |
| Online Sampling from Log-Concave Distributions | 2019-02-21 | Paper |
A dynamics for advertising on networks
Web and Internet Economics | 2019-01-30 | Paper |
The mixing time of the Dikin walk in a polytope -- a simple proof
Operations Research Letters | 2019-01-11 | Paper |
Evolutionary dynamics in finite populations mix rapidly
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Natural algorithms for flow problems
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Random walks in polytopes and negative dependence | 2018-05-03 | Paper |
On Geodesically Convex Formulations for the Brascamp-Lieb Constant
(available as arXiv preprint) | 2018-04-11 | Paper |
| Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo | 2018-02-24 | Paper |
| Mixing time of Markov chains, dynamical systems and evolution | 2017-12-19 | Paper |
A distributed learning dynamics in social groups
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
The speed of evolution
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| On LP-based approximability for strict CSPs | 2017-09-29 | Paper |
| Algorithms and hardness for subspace approximation | 2017-09-29 | Paper |
| Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition | 2017-09-29 | Paper |
Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
(available as arXiv preprint) | 2017-09-29 | Paper |
Real stable polynomials and matroids: optimization and counting
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Making evolution rigorous: the error threshold
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Extended Formulations for Polytopes of Regular Matroids | 2016-12-31 | Paper |
On the computational complexity of limit cycles in dynamical systems
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into \(\ell_1\)
Journal of the ACM | 2015-08-14 | Paper |
Entropy, optimization and counting
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Almost polynomial factor hardness for closest vector problem with preprocessing
SIAM Journal on Computing | 2014-09-18 | Paper |
Faster algorithms via approximation theory
Foundations and Trends® in Theoretical Computer Science | 2014-07-10 | Paper |
Faster algorithms via approximation theory
Foundations and Trends® in Theoretical Computer Science | 2014-07-10 | Paper |
Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
\(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| scientific article; zbMATH DE number 6276186 (Why is no real title available?) | 2014-04-01 | Paper |
Lx = b
Foundations and Trends® in Theoretical Computer Science | 2014-02-03 | Paper |
Hardness of approximating the closest vector problem with pre-processing
Computational Complexity | 2012-06-26 | Paper |
On the Fourier spectrum of symmetric Boolean functions
Combinatorica | 2010-08-13 | Paper |
Improved algorithm for degree bounded survivable network design problem
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters | 2010-06-16 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2009-05-26 | Paper |
| Unique games on expanding constraint graphs are easy (extended abstract) | 2009-01-05 | Paper |
Caching with Expiration Times for Internet Applications
Internet Mathematics | 2006-05-09 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2119709 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079409 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2046082 (Why is no real title available?) | 2004-02-22 | Paper |
| scientific article; zbMATH DE number 1735789 (Why is no real title available?) | 2002-10-17 | Paper |
