| Convergence of incentive-driven dynamics in Fisher markets | 0 | 0.34 | 2022 |
| Approximation algorithms for clustering with dynamic points | 0 | 0.34 | 2022 |
| Shortest Paths without a Map, but with an Entropic Regularizer. | 0 | 0.34 | 2022 |
| A refined approximation for Euclidean k-means | 0 | 0.34 | 2022 |
| Proportional Dynamics in Exchange Economies | 0 | 0.34 | 2021 |
| Source Identification for Mixtures of Product Distributions. | 0 | 0.34 | 2021 |
| Min-Sum Clustering (With Outliers). | 0 | 0.34 | 2021 |
| Approximation Algorithms for Clustering with Dynamic Points | 0 | 0.34 | 2020 |
| Parametrized Metrical Task Systems. | 0 | 0.34 | 2020 |
| Parametrized Metrical Task Systems. | 0 | 0.34 | 2019 |
| Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. | 0 | 0.34 | 2018 |
| Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. | 0 | 0.34 | 2017 |
| Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration. | 0 | 0.34 | 2017 |
| Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces. | 0 | 0.34 | 2017 |
| Convergence of Incentive-Driven Dynamics in Fisher Markets. | 1 | 0.35 | 2017 |
| Market Dynamics of Best-Response with Lookahead. | 0 | 0.34 | 2016 |
| Editorial to the Special Issue on SODA'12. | 5 | 0.43 | 2016 |
| Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration. | 0 | 0.34 | 2016 |
| Learning Arbitrary Statistical Mixtures of Discrete Distributions. | 3 | 0.50 | 2015 |
| On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs | 5 | 0.46 | 2015 |
| Convergence of Tâtonnement in Fisher Markets. | 0 | 0.34 | 2014 |
| An Optimal Randomized Online Algorithm for Reordering Buffer Management | 8 | 0.50 | 2013 |
| Learning Mixtures of Distributions over Large Discrete Domains. | 0 | 0.34 | 2012 |
| Local Versus Global Properties of Metric Spaces | 10 | 0.82 | 2012 |
| A constant factor approximation algorithm for reordering buffer management | 8 | 0.49 | 2012 |
| Confluent Persistence Revisited | 0 | 0.34 | 2012 |
| The effectiveness of lloyd-type methods for the k-means problem | 96 | 8.63 | 2012 |
| Learning mixtures of arbitrary distributions over large discrete domains | 7 | 0.51 | 2012 |
| Unconditionally-Secure robust secret sharing with compact shares | 22 | 0.81 | 2012 |
| An improved approximation algorithm for resource allocation | 8 | 0.53 | 2011 |
| Explicit Dimension Reduction and Its Applications | 10 | 0.59 | 2011 |
| On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data | 2 | 0.37 | 2011 |
| Monotonicity in Bargaining Networks | 5 | 0.50 | 2010 |
| Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform | 7 | 0.52 | 2010 |
| Explicit construction of a small epsilon-net for linear threshold functions | 12 | 0.70 | 2010 |
| Error-correcting codes for automatic control | 24 | 1.22 | 2009 |
| Low Distortion Maps Between Point Sets | 38 | 1.66 | 2009 |
| On Earthmover Distance, Metric Labeling, and 0-Extension | 4 | 0.43 | 2009 |
| Improved Lower Bounds for Embeddings intoL1 | 5 | 0.41 | 2009 |
| Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem | 1 | 0.39 | 2008 |
| Approximation algorithms for labeling hierarchical taxonomies | 1 | 0.36 | 2008 |
| Low distortion embeddings for edit distance | 43 | 2.20 | 2007 |
| Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems | 29 | 1.16 | 2007 |
| On the Hardness of Approximating Multicut and Sparsest-Cut | 112 | 6.23 | 2006 |
| Approximation algorithms for graph homomorphism problems | 12 | 0.68 | 2006 |
| Improved lower bounds for embeddings into L1 | 20 | 1.64 | 2006 |
| Approximating Directed Multicuts | 21 | 1.52 | 2005 |
| Approximating k-median with non-uniform capacities | 14 | 0.68 | 2005 |
| Stability preserving transformations: packet routing networks with edge capacities and speeds | 20 | 0.89 | 2004 |
| Approximation algorithms for the 0-extension problem | 58 | 4.51 | 2004 |
