Yuval Rabani

Orcid: 0000-0001-7772-2544

Affiliations:
  • The Hebrew University of Jerusalem, Jerusalem, Israel


According to our database1, Yuval Rabani authored at least 100 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Causal Discovery under Latent Class Confounding.
CoRR, 2023

Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity.
CoRR, 2023

The Randomized k-Server Conjecture Is False!
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Generalized Unrelated Machine Scheduling Problem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Causal Inference Despite Limited Global Confounding via Mixture Models.
Proceedings of the Conference on Causal Learning and Reasoning, 2023

2022
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions.
SIAM J. Comput., December, 2022

Approximation algorithms for clustering with dynamic points.
J. Comput. Syst. Sci., 2022

A refined approximation for Euclidean k-means.
Inf. Process. Lett., 2022

Convergence of incentive-driven dynamics in Fisher markets.
Games Econ. Behav., 2022

Shortest Paths without a Map, but with an Entropic Regularizer.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Identifying Mixtures of Bayesian Network Distributions.
CoRR, 2021

Online Multiserver Convex Chasing and Optimization.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Proportional Dynamics in Exchange Economies.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Source Identification for Mixtures of Product Distributions.
Proceedings of the Conference on Learning Theory, 2021

Min-Sum Clustering (With Outliers).
Proceedings of the Approximation, 2021

2020
The Sparse Hausdorff Moment Problem, with Application to Topic Models.
CoRR, 2020

Parametrized Metrical Task Systems.
Proceedings of the Approximation, 2020

2018
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Matrix Balancing in <i>L</i><sub>p</sub> Norms: Bounding the Convergence Rate of Osborne's Iteration.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces.
Proceedings of the Approximation, 2017

2016
Editorial to the Special Issue on SODA'12.
ACM Trans. Algorithms, 2016

Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration.
CoRR, 2016

Market Dynamics of Best-Response with Lookahead.
CoRR, 2016

2015
An Improved Competitive Algorithm for Reordering Buffer Management.
ACM Trans. Algorithms, 2015

Learning Arbitrary Statistical Mixtures of Discrete Distributions.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Convergence of Tâtonnement in Fisher Markets.
CoRR, 2014

Learning mixtures of arbitrary distributions over large discrete domains.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
A Constant Factor Approximation Algorithm for Reordering Buffer Management.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An optimal randomized online algorithm for reordering buffer management.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Local Versus Global Properties of Metric Spaces.
SIAM J. Comput., 2012

The effectiveness of lloyd-type methods for the k-means problem.
J. ACM, 2012

Learning Mixtures of Distributions over Large Discrete Domains.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
An improved approximation algorithm for resource allocation.
ACM Trans. Algorithms, 2011

On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions.
SIAM J. Comput., 2010

Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform
CoRR, 2010

Monotonicity in Bargaining Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Error-correcting codes for automatic control.
IEEE Trans. Inf. Theory, 2009

Bicriteria approximation tradeoff for the node-cost budget problem.
ACM Trans. Algorithms, 2009

Improved Lower Bounds for Embeddings intoL<sub>1</sub>$.
SIAM J. Comput., 2009

Low Distortion Maps Between Point Sets.
SIAM J. Comput., 2009

Explicit Dimension Reduction and Its Applications.
Electron. Colloquium Comput. Complex., 2009

2008
Approximation algorithms for labeling hierarchical taxonomies.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Linear Programming.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems.
SIAM J. Comput., 2007

Low distortion embeddings for edit distance.
J. ACM, 2007

2006
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.
Math. Oper. Res., 2006

On the Hardness of Approximating Multicut and Sparsest-Cut.
Comput. Complex., 2006

Improved lower bounds for embeddings into <i>L</i><sub>1</sub>.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Approximation Algorithms for Graph Homomorphism Problems.
Proceedings of the Approximation, 2006

2005
On earthmover distance, metric labeling, and 0-extension
Electron. Colloquium Comput. Complex., 2005

Approximating Directed Multicuts.
Comb., 2005

Approximating k-median with non-uniform capacities.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Approximation Algorithms for the 0-Extension Problem.
SIAM J. Comput., 2004

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.
Mach. Learn., 2004

Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds.
J. Interconnect. Networks, 2004

Cell-probe lower bounds for the partial match problem.
J. Comput. Syst. Sci., 2004

2003
Approximation schemes for clustering problems.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model.
J. Comput. Syst. Sci., 2002

Polynomial-time approximation schemes for geometric min-sum median clustering.
J. ACM, 2002

Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electron. Colloquium Comput. Complex., 2002

Improved Approximation Algorithms for Resource Allocation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Search and Classification of High Dimensional Data.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Fairness in Routing and Load Balancing.
J. Comput. Syst. Sci., 2001

Approximation algorithms for constrained for constrained node weighted steiner tree problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Tree packing and approximating k-cuts.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.
SIAM J. Comput., 2000

Allocating Bandwidth for Bursty Connections.
SIAM J. Comput., 2000

A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems.
SIAM J. Comput., 2000

An Improved Approximation Algorithm for MULTIWAY CUT.
J. Comput. Syst. Sci., 2000

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, 2000

Polynomial Time Approximation Schemes for Geometric k-Clustering.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput., 1998

An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm.
SIAM J. Comput., 1998

A computational view of population genetics.
Random Struct. Algorithms, 1998

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing.
J. Algorithms, 1998

Fairness in Scheduling
J. Algorithms, 1998

Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Deterministic Many-to-Many Hot Potato Routing.
IEEE Trans. Parallel Distributed Syst., 1997

Universal <i>O</i>(Congestion + Dilation + log<sup>1+epsilon</sup><i>N</i>) Local Control Packet Switching Algorithms.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
On the Value of Coordination in Distributed Decision Making.
SIAM J. Comput., 1996

Distributed Packet Switching in Arbitrary Networks.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Path Coloring on the Mesh.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Competitive Algorithms for Distributed Data Management.
J. Comput. Syst. Sci., 1995

Improved Bounds for All Optical Routing.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.
SIAM J. Comput., 1994

Competitive k-Server Algorithms.
J. Comput. Syst. Sci., 1994

A Better Lower Bound for On-Line Scheduling.
Inf. Process. Lett., 1994

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
Algorithmica, 1994

Simulating quadratic dynamical systems is PSPACE-complete (preliminary version).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

On-line Admission Control and Circuit Routing for High Performance Computing and Communication
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
On the Value of Information in Coordination Games (preliminary version)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
On the Space Complexity of Some Algorithms for Sequence Comparison.
Theor. Comput. Sci., 1992

Competitive Algorithms for Distributed Data Management (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Decomposition Theorem and Bounds for Randomized Server Problems
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990
Competitive k-Server Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...