| Publication | Date of Publication | Type |
|---|
| The effectiveness of Lloyd-type methods for the k-means problem | 2026-05-29 | Paper |
| Polynomial time approximation schemes for geometric k-clustering | 2026-05-08 | Paper |
| Approximating directed multicuts | 2026-05-08 | Paper |
| Fairness in routing and load balancing | 2026-05-06 | Paper |
| Local divergence of Markov chains and the analysis of iterative load-balancing schemes | 2025-10-29 | Paper |
Shortest paths without a map, but with an entropic regularizer
SIAM Journal on Computing | 2025-10-24 | Paper |
| Shortest paths without a map, but with an entropic regularizer | 2025-08-15 | Paper |
| An optimal randomized online algorithm for reordering buffer management | 2025-05-20 | Paper |
| Generalized unrelated machine scheduling problem | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788463 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7768361 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Parametrized Metrical Task Systems
(available as arXiv preprint) | 2023-10-31 | Paper |
| Approximation algorithms for clustering with dynamic points | 2023-02-07 | Paper |
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
SIAM Journal on Computing | 2022-11-15 | Paper |
| The Randomized k-Server Conjecture is False! | 2022-11-10 | Paper |
Approximation algorithms for clustering with dynamic points
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Convergence of incentive-driven dynamics in Fisher markets
Games and Economic Behavior | 2022-07-15 | Paper |
A refined approximation for Euclidean \(k\)-means
Information Processing Letters | 2022-04-07 | Paper |
The invisible hand of Laplace: the role of market structure in price convergence and oscillation
Journal of Mathematical Economics | 2021-09-01 | Paper |
The invisible hand of Laplace: the role of market structure in price convergence and oscillation
Journal of Mathematical Economics | 2021-09-01 | Paper |
scientific article; zbMATH DE number 7376020 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces
(available as arXiv preprint) | 2021-07-28 | Paper |
A Constant Factor Approximation Algorithm for Reordering Buffer Management
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An improved competitive algorithm for reordering buffer management
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Convergence of incentive-driven dynamics in Fisher markets
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Error-Correcting Codes for Automatic Control
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On Lipschitz extension from finite subsets
Israel Journal of Mathematics | 2017-06-07 | Paper |
Learning mixtures of arbitrary distributions over large discrete domains
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Lower bounds for high dimensional nearest neighbor search and related problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM | 2015-10-30 | Paper |
On the randomized competitive ratio of reordering buffer management with non-uniform costs
Automata, Languages, and Programming | 2015-10-27 | Paper |
Learning Arbitrary Statistical Mixtures of Discrete Distributions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Learning Arbitrary Statistical Mixtures of Discrete Distributions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Approximation algorithms for constrained node weighted Steiner tree problems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| Approximating k-median with non-uniform capacities | 2014-10-13 | Paper |
Tighter bounds for nearest neighbor search and related problems in the cell probe model
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
An improved approximation algorithm for \textsc{Resource Allocation}
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| An improved competitive algorithm for reordering buffer management | 2014-05-22 | Paper |
The effectiveness of Lloyd-type methods for the \(k\)-means problem
Journal of the ACM | 2014-02-17 | Paper |
Unconditionally-secure robust secret sharing with compact shares
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Explicit dimension reduction and its applications
SIAM Journal on Computing | 2012-05-30 | Paper |
Local versus global properties of metric spaces
SIAM Journal on Computing | 2012-05-30 | Paper |
| On parsimonious explanations for 2-D tree- and linearly-ordered data | 2012-01-23 | Paper |
Explicit construction of a small -net for linear threshold functions
SIAM Journal on Computing | 2011-04-04 | Paper |
Low Distortion Maps Between Point Sets
SIAM Journal on Computing | 2010-09-06 | Paper |
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Improved lower bounds for embeddings into <i>L</i><sub>1</sub>
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Low distortion embeddings for edit distance
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Local versus global properties of metric spaces
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Low distortion maps between point sets
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764788 (Why is no real title available?) | 2010-08-06 | Paper |
On earthmover distance, metric labeling, and 0-extension
SIAM Journal on Computing | 2010-04-29 | Paper |
Improved lower bounds for embeddings into \(L_1\)
SIAM Journal on Computing | 2010-01-06 | Paper |
Low distortion embeddings for edit distance
Journal of the ACM | 2008-12-21 | Paper |
Competitive algorithms for distributed data management.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
SIAM Journal on Computing | 2008-04-22 | Paper |
On the hardness of approximating Multicut and Sparsest-Cut
Computational Complexity | 2007-11-05 | Paper |
Approximation Algorithms for Graph Homomorphism Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs
Journal of Functional Analysis | 2005-11-22 | Paper |
| scientific article; zbMATH DE number 2209718 (Why is no real title available?) | 2005-09-28 | Paper |
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing | 2005-02-21 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Machine Learning | 2005-01-19 | Paper |
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2086936 (Why is no real title available?) | 2004-08-11 | Paper |
| Stability preserving transformations: Packet routing networks with edge capacities and speeds | 2004-01-14 | Paper |
| scientific article; zbMATH DE number 1947041 (Why is no real title available?) | 2003-07-07 | Paper |
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences | 2002-09-12 | Paper |
| scientific article; zbMATH DE number 1775387 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1775451 (Why is no real title available?) | 2002-08-01 | Paper |
| Tree packing and approximating k-cuts | 2002-06-30 | Paper |
| Approximation algorithms for the 0-extension problem | 2002-06-30 | Paper |
Fairness in routing and load balancing
Journal of Computer and System Sciences | 2002-02-27 | Paper |
| scientific article; zbMATH DE number 1256655 (Why is no real title available?) | 2002-01-17 | Paper |
A decomposition theorem for task systems and bounds for randomized server problems
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559582 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1559580 (Why is no real title available?) | 2001-03-01 | Paper |
An improved approximation algorithm of MULTIWAY CUT.
Journal of Computer and System Sciences | 2000-11-21 | Paper |
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing | 2000-10-18 | Paper |
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1256754 (Why is no real title available?) | 2000-05-18 | Paper |
| A computational view of population genetics | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1263184 (Why is no real title available?) | 1999-03-16 | Paper |
Fairness in Scheduling
Journal of Algorithms | 1999-01-17 | Paper |
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
Journal of Algorithms | 1998-10-21 | Paper |
Competitive Algorithms for Layered Graph Traversal
SIAM Journal on Computing | 1998-09-21 | Paper |
An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing | 1998-05-10 | Paper |
On the Value of Coordination in Distributed Decision Making
SIAM Journal on Computing | 1997-02-03 | Paper |
| scientific article; zbMATH DE number 910915 (Why is no real title available?) | 1996-10-21 | Paper |
| scientific article; zbMATH DE number 910905 (Why is no real title available?) | 1996-07-28 | Paper |
| scientific article; zbMATH DE number 871932 (Why is no real title available?) | 1996-04-28 | Paper |
A deterministic O(k^ 3)-competitive k-server algorithm for the circle
Algorithmica | 1994-07-21 | Paper |
Competitive k-server algorithms
Journal of Computer and System Sciences | 1994-06-29 | Paper |
A better lower bound for on-line scheduling
Information Processing Letters | 1994-06-15 | Paper |
Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms
SIAM Journal on Computing | 1994-05-10 | Paper |
On the space complexity of some algorithms for sequence comparison
Theoretical Computer Science | 1992-06-28 | Paper |
