| Publication | Date of Publication | Type |
|---|
| Sampling matrices from Harish-Chandra–Itzykson–Zuber densities with applications to Quantum inference and differential privacy | 2023-11-14 | Paper |
| Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization | 2023-11-14 | Paper |
| On the computability of continuous maximum entropy distributions with applications | 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 | 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) | 2021-08-20 | Paper |
| On geodesically convex formulations for the Brascamp-Lieb constant | 2021-08-04 | Paper |
| On the complexity of constrained determinantal point processes | 2021-07-28 | Paper |
| Ranking with Fairness Constraints | 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 | 2021-04-14 | Paper |
| Isolating a vertex via lattices: polytopes with totally unimodular faces | 2021-04-14 | Paper |
| On the computability of continuous maximum entropy distributions with applications | 2021-01-19 | Paper |
| Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal | 2021-01-19 | Paper |
| Subdeterminant maximization via nonconvex relaxations and anti-concentration | 2021-01-13 | Paper |
| Dynamic sampling from graphical models | 2020-01-30 | Paper |
| On the number of circuits in regular matroids (with connections to lattices and codes) | 2019-10-15 | Paper |
| Belief Propagation, Bethe Approximation and Polynomials | 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 | 2019-01-30 | Paper |
| The mixing time of the Dikin walk in a polytope -- a simple proof | 2019-01-11 | Paper |
| Evolutionary dynamics in finite populations mix rapidly | 2018-07-16 | Paper |
| Natural algorithms for flow problems | 2018-07-16 | Paper |
| Random walks in polytopes and negative dependence | 2018-05-03 | Paper |
| On Geodesically Convex Formulations for the Brascamp-Lieb Constant | 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 | 2017-10-11 | Paper |
| The speed of evolution | 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 |
| Real stable polynomials and matroids: optimization and counting | 2017-08-17 | Paper |
| Making evolution rigorous: the error threshold | 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 | 2016-04-15 | Paper |
| The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into \(\ell_1\) | 2015-08-14 | Paper |
| Entropy, optimization and counting | 2015-06-26 | Paper |
| Integrality gaps for sparsest cut and minimum linear arrangement problems | 2014-11-25 | Paper |
| Almost polynomial factor hardness for closest vector problem with preprocessing | 2014-09-18 | Paper |
| Faster algorithms via approximation theory | 2014-07-10 | Paper |
| Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator | 2014-05-13 | Paper |
| \(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405192 | 2014-04-01 | Paper |
| Lx = b | 2014-02-03 | Paper |
| Hardness of approximating the closest vector problem with pre-processing | 2012-06-26 | Paper |
| On the Fourier spectrum of symmetric Boolean functions | 2010-08-13 | Paper |
| Improved algorithm for degree bounded survivable network design problem | 2010-06-22 | Paper |
| Deterministically testing sparse polynomial identities of unbounded degree | 2010-06-16 | Paper |
| Stochastic Algorithms: Foundations and Applications | 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 | 2006-05-09 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828981 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471369 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451064 | 2004-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329139 | 2002-10-17 | Paper |
