Kunal Talwar

Jinho Bok

SIAM J. Comput., 2024

Privacy-Computation trade-offs in Private Repetition and Metaselection.

[BibT_eX]

[DOI]

CoRR, 2024

Adaptive Batch Size for Privately Finding Second-Order Stationary Points.

[BibT_eX]

[DOI]

Daogao Liu

CoRR, 2024

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization.

[BibT_eX]

[DOI]

Guy Kornowski

Daogao Liu

CoRR, 2024

Instance-Optimal Private Density Estimation in the Wasserstein Distance.

[BibT_eX]

[DOI]

CoRR, 2024

Scalable Private Search with Wally.

[BibT_eX]

[DOI]

Hilal Asi

Fabian Boemer

Nicholas Genise

Muhammad Haris Mughees

CoRR, 2024

Private Online Learning via Lazy Algorithms.

[BibT_eX]

[DOI]

CoRR, 2024

PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector.

[BibT_eX]

[DOI]

Proceedings of the 33rd USENIX Security Symposium, 2024

Differentially Private Heavy Hitter Detection using Federated Analytics.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Secure and Trustworthy Machine Learning, 2024

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Samplable Anonymous Aggregation for Private Federated Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors.

[BibT_eX]

[DOI]

CoRR, 2023

Federated Learning with Differential Privacy for End-to-End Speech Recognition.

[BibT_eX]

[DOI]

CoRR, 2023

Samplable Anonymous Aggregation for Private Federated Data Analysis.

[BibT_eX]

[DOI]

CoRR, 2023

Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential Privacy.

[BibT_eX]

[DOI]

Audra McMillan

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fast Optimal Locally Private Mean Estimation via Random Projections.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Private Online Prediction from Experts: Separations and Faster Rates.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Concentration of the Langevin Algorithm's Stationary Distribution.

[BibT_eX]

[DOI]

CoRR, 2022

Private Federated Statistics in an Interactive Setting.

[BibT_eX]

[DOI]

CoRR, 2022

FLAIR: Federated Learning Annotated Image Repository.

[BibT_eX]

[DOI]

Congzheng Song

Filip Granqvist

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Subspace Recovery from Heterogeneous Data with Non-isotropic Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Mean Estimation with User-level Privacy under Data Heterogeneity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss.

[BibT_eX]

[DOI]

Charalampos E. Tsourakakis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering.

[BibT_eX]

[DOI]

Lorenzo Orecchia

Konstantinos Ameranis

Proceedings of the International Conference on Machine Learning, 2022

Private frequency estimation via projective geometry.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Optimal Algorithms for Mean Estimation under Local Differential Privacy.

[BibT_eX]

[DOI]

Hilal Asi

Proceedings of the International Conference on Machine Learning, 2022

Differential Secrecy for Distributed Data and Applications to Robust Differentially Secure Vector Summation.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Foundations of Responsible Computing, 2022

2021

Online Learning over a Finite Action Set with Limited Switching.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Private Stochastic Convex Optimization: Optimal Rates in 𝓁<sub>1</sub> Geometry.

[BibT_eX]

[DOI]

CoRR, 2021

When is memorization of irrelevant training data necessary for high-accuracy learning?

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Characterizing Structural Regularities of Labeled Data in Overparameterized Models.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Lossless Compression of Efficient Private Local Randomizers.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Private Adaptive Gradient Methods for Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling.

[BibT_eX]

[DOI]

Audra McMillan

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Exploring the Memorization-Generalization Continuum in Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2020

Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation.

[BibT_eX]

[DOI]

CoRR, 2020

Private stochastic convex optimization: optimal rates in linear time.

[BibT_eX]

[DOI]

Tomer Koren

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

On the Error Resistance of Hinge-Loss Minimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Faster Differentially Private Samplers via Rényi Divergence Analysis of Discretized Langevin MCMC.

[BibT_eX]

[DOI]

Arun Ganesh

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stochastic Optimization with Laggard Data Pipelines.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Rényi Differential Privacy of the Sampled Gaussian Mechanism.

[BibT_eX]

[DOI]

Ilya Mironov

CoRR, 2019

Private selection from private candidates.

[BibT_eX]

[DOI]

Jingcheng Liu

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computational Separations between Sampling and Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Private Stochastic Convex Optimization with Optimal Rates.

[BibT_eX]

[DOI]

Raef Bassily

Abhradeep Guha Thakurta

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Semi-Cyclic Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Better Algorithms for Stochastic Bandits with Adversarial Corruptions.

[BibT_eX]

[DOI]

Tomer Koren

Proceedings of the Conference on Learning Theory, 2019

2018

Adversarially Robust Generalization Requires More Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Online Linear Quadratic Control.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Scalable Private Learning with PATE.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Learning Representations, 2018

Learning Differentially Private Recurrent Language Models.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Learning Representations, 2018

Privacy Amplification by Iteration.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Balancing Vectors in Any Norm.

[BibT_eX]

[DOI]

Daniel Dadush

Nicole Tomczak-Jaegermann

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Learning Differentially Private Language Models Without Losing Accuracy.

[BibT_eX]

[DOI]

CoRR, 2017

Oblivious Stash Shuffle.

[BibT_eX]

[DOI]

Petros Maniatis

Ilya Mironov

CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches.

[BibT_eX]

[DOI]

CoRR, 2017

LAST but not Least: Online Spanners for Buy-at-Bulk.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Semi-supervised Knowledge Transfer for Deep Learning from Private Training Data.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Learning Representations, 2017

Short and Deep: Sketching and Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Learning Representations, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approches.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016

Approximating Metric Spaces by Tree Metrics.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

The Geometry of Differential Privacy: The Small Database and Approximate Cases.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Sketching and Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2016

TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems.

[BibT_eX]

[DOI]

CoRR, 2016

Deep Learning with Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Graphical balanced allocations and the (1 + β)-choice process.

[BibT_eX]

[DOI]

Yuval Peres

Random Struct. Algorithms, 2015

Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations.

[BibT_eX]

[DOI]

Cynthia Dwork

Discret. Comput. Geom., 2015

Approximating Hereditary Discrepancy via Small Width Ellipsoids.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Nearly Optimal Private LASSO.

[BibT_eX]

[DOI]

Abhradeep Thakurta

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Navigation made personal: inferring driving preferences from GPS traces.

[BibT_eX]

[DOI]

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

2014

Vertex Sparsifiers: New Results from Old Techniques.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Private Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry.

[BibT_eX]

[DOI]

Abhradeep Thakurta

CoRR, 2014

Factorization Norms and Hereditary Discrepancy.

[BibT_eX]

[DOI]

Jirí Matousek

CoRR, 2014

Consistent Weighted Sampling Made Fast, Small, and Easy.

[BibT_eX]

[DOI]

Bernhard Haeupler

Mark S. Manasse

CoRR, 2014

Analyze gauss: optimal bounds for privacy-preserving principal component analysis.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Non-Uniform Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Balanced Allocations: A Simple Proof for the Heavily Loaded Case.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Changing Bases: Multistage Optimization for Matroids and Matchings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Using Convex Relaxations for Efficiently and Privately Releasing Marginals.

[BibT_eX]

[DOI]

Cynthia Dwork

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier.

[BibT_eX]

[DOI]

Ittai Abraham

Shiri Chechik

Proceedings of the Approximation, 2014

Approximation Algorithms.

[BibT_eX]

[DOI]

Mohit Singh

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Random Rates for 0-Extension and Low-Diameter Decompositions.

[BibT_eX]

[DOI]

CoRR, 2013

The geometry of differential privacy: the sparse and approximate cases.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Sparsest cut on bounded treewidth graphs: algorithms and hardness results.

[BibT_eX]

[DOI]

David Witmer

Proceedings of the Symposium on Theory of Computing Conference, 2013

On differentially private low rank approximation.

[BibT_eX]

[DOI]

Michael Kapralov

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Minimum Makespan Scheduling with Low Rank Processing Times.

[BibT_eX]

[DOI]

Aditya Bhaskara

Ravishankar Krishnaswamy

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Efficient distributed approximation algorithms via probabilistic tree embeddings.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Unconditional differentially private mechanisms for linear queries.

[BibT_eX]

[DOI]

Aditya Bhaskara

Daniel Dadush

Ravishankar Krishnaswamy

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

The Limits of Two-Party Differential Privacy.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Making Doubling Metrics Geodesic.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Ultra-low-dimensional embeddings for doubling metrics.

[BibT_eX]

[DOI]

T.-H. Hubert Chan

J. ACM, 2010

Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

On the geometry of differential privacy.

[BibT_eX]

[DOI]

Moritz Hardt

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

The (1 + beta)-Choice Process and Weighted Balls-into-Bins.

[BibT_eX]

[DOI]

Yuval Peres

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Differentially Private Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Hard Instances for Satisfiability and Quasi-one-way Functions.

[BibT_eX]

[DOI]

Andrej Bogdanov

Andrew Wan

Proceedings of the Innovations in Computer Science, 2010

Lower Bounds on Near Neighbor Search via Metric Expansion.

[BibT_eX]

[DOI]

Rina Panigrahy

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Improving Integrality Gaps via Chvátal-Gomory Rounding.

[BibT_eX]

[DOI]

Mohit Singh

Proceedings of the Approximation, 2010

2009

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.

[BibT_eX]

[DOI]

Kamalika Chaudhuri

Samantha J. Riesenfeld

Theor. Comput. Sci., 2009

Differentially Private Approximation Algorithms

[BibT_eX]

[DOI]

CoRR, 2009

Approximating the Bandwidth of Caterpillars.

[BibT_eX]

[DOI]

Uriel Feige

Algorithmica, 2009

What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.

[BibT_eX]

[DOI]

Kamalika Chaudhuri

Samantha J. Riesenfeld

Algorithmica, 2009

Virtual Ring Routing Trends.

[BibT_eX]

[DOI]

Dahlia Malkhi

Siddhartha Sen

Renato Fonseca F. Werneck

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Quincy: fair scheduling for distributed computing clusters.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, 2009

Secretary problems: weights and discounts.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Approximating Metric Spaces by Tree Metrics.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

How to Complete a Doubling Metric.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem.

[BibT_eX]

[DOI]

David B. Shmoys

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.

[BibT_eX]

[DOI]

Rina Panigrahy

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

Balanced allocations: the weighted case.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

The price of privacy and the limits of LP decoding.

[BibT_eX]

[DOI]

Cynthia Dwork

Frank McSherry

Venugopalan Ramasubramanian

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Hardness of routing with congestion in directed graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Privacy, accuracy, and consistency too: a holistic solution to contingency table release.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Reconstructing approximate tree metrics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Mechanism Design via Differential Privacy.

[BibT_eX]

[DOI]

Frank McSherry

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Balloon Popping With Applications to Ascending Auctions.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Hardness of Low Congestion Routing in Directed Graphs.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2006

Approximating unique games.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.

[BibT_eX]

[DOI]

Kamalika Chaudhuri

Samantha J. Riesenfeld

Mohammad Taghi Hajiaghayi

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

A Simple Characterization for Truth-Revealing Single-Item Auctions.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Click Fraud Resistant Methods for Learning Click-Through Rates.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

On Privacy-Preserving Histograms.

[BibT_eX]

[DOI]

Proceedings of the UAI '05, 2005

The Generalized Deadlock Resolution Problem.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Approximating metrics by tree metrics.

[BibT_eX]

[DOI]

SIGACT News, 2004

A tight bound on approximating arbitrary metrics by tree metrics.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Bypassing the embedding: algorithms for low dimensional metrics.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

The complexity of pure Nash equilibria.

[BibT_eX]

[DOI]

Alex Fabrikant

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Approximate classification via earthmover metrics.

[BibT_eX]

[DOI]

Aaron Archer

Christos H. Papadimitriou

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.

[BibT_eX]

[DOI]

Aaron Archer

Éva Tardos

Internet Math., 2003

The Price of Truth: Frugality in Truthful Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

An improved approximation algorithm for the 0-extension problem.

[BibT_eX]

[DOI]

Chris Harrelson

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

Paths, Trees, and Minimum Latency Tours.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.

[BibT_eX]

[DOI]