| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128559 | 2024-04-15 | Paper |
| Concentration of the Langevin Algorithm's Stationary Distribution | 2022-12-23 | Paper |
| Online Learning over a Finite Action Set with Limited Switching | 2021-06-03 | Paper |
| Private stochastic convex optimization: optimal rates in linear time | 2021-01-19 | Paper |
| Faster Differentially Private Samplers via R\'enyi Divergence Analysis of Discretized Langevin MCMC | 2020-10-27 | Paper |
| Private Stochastic Convex Optimization: Optimal Rates in Linear Time | 2020-05-10 | Paper |
| Factorization Norms and Hereditary Discrepancy | 2020-02-24 | Paper |
| Private selection from private candidates | 2020-01-30 | Paper |
| Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity | 2019-10-15 | Paper |
| Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs | 2019-09-02 | Paper |
| Non-Uniform Graph Partitioning | 2019-06-20 | Paper |
| Minimum Makespan Scheduling with Low Rank Processing Times | 2019-05-15 | Paper |
| On differentially private low rank approximation | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633940 | 2019-05-06 | Paper |
| LAST but not Least: Online Spanners for Buy-at-Bulk | 2018-07-16 | Paper |
| Using Convex Relaxations for Efficiently and Privately Releasing Marginals | 2018-04-23 | Paper |
| Online learning over a finite action set with limited switching | 2018-03-05 | Paper |
| Approximating Hereditary Discrepancy via Small Width Ellipsoids | 2017-10-05 | Paper |
| Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier | 2017-03-22 | Paper |
| The Geometry of Differential Privacy: The Small Database and Approximate Cases | 2016-05-12 | Paper |
| Smooth Boolean Functions are Easy | 2016-04-15 | Paper |
| Graphical balanced allocations and the (1 + β)-choice process | 2016-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501372 | 2015-08-03 | Paper |
| Analyze gauss | 2015-06-26 | Paper |
| Cops, robbers, and threatening skeletons | 2015-06-26 | Paper |
| Efficient algorithms for privately releasing marginals via convex relaxations | 2015-06-18 | Paper |
| On the hereditary discrepancy of homogeneous arithmetic progressions | 2015-04-22 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2014-12-12 | Paper |
| Vertex Sparsifiers: New Results from Old Techniques | 2014-11-14 | Paper |
| On the geometry of differential privacy | 2014-08-13 | Paper |
| The Geometry of Differential Privacy: The Small Database and Approximate Cases | 2014-08-07 | Paper |
| Sparsest cut on bounded treewidth graphs | 2014-08-07 | Paper |
| Changing Bases: Multistage Optimization for Matroids and Matchings | 2014-07-01 | Paper |
| Balanced Allocations: A Simple Proof for the Heavily Loaded Case | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417694 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417735 | 2014-05-22 | Paper |
| Unconditional differentially private mechanisms for linear queries | 2014-05-13 | Paper |
| Reconstructing approximate tree metrics | 2014-03-13 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2013-02-04 | Paper |
| Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs | 2011-12-19 | Paper |
| Making doubling metrics geodesic | 2011-03-02 | Paper |
| Improving Integrality Gaps via Chvátal-Gomory Rounding | 2010-09-10 | Paper |
| Vertex Sparsifiers: New Results from Old Techniques | 2010-09-10 | Paper |
| Approximating unique games | 2010-08-16 | Paper |
| The complexity of pure Nash equilibria | 2010-08-15 | Paper |
| Bypassing the embedding | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579397 | 2010-08-06 | Paper |
| Ultra-low-dimensional embeddings for doubling metrics | 2010-07-14 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Virtual Ring Routing Trends | 2009-11-19 | Paper |
| Approximating the bandwidth of caterpillars | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549600 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549611 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549621 | 2009-01-05 | Paper |
| A Constant Approximation Algorithm for the a priori Traveling Salesman Problem | 2008-06-10 | Paper |
| How to Complete a Doubling Metric | 2008-04-15 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737546 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471296 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418685 | 2003-08-11 | Paper |
