Person:222776

Available identifiers

zbMath Open rabani.yuvalWikidataQ102302629 ScholiaQ102302629MaRDI QIDQ222776

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147381	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6090888	2023-11-20	Paper
Parametrized Metrical Task Systems	2023-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q5874506	2023-02-07	Paper
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions	2022-11-15	Paper
The Randomized $k$-Server Conjecture is False!	2022-11-10	Paper
Approximation algorithms for clustering with dynamic points	2022-08-26	Paper
Convergence of incentive-driven dynamics in Fisher markets	2022-07-15	Paper
A refined approximation for Euclidean \(k\)-means	2022-04-07	Paper
The invisible hand of Laplace: the role of market structure in price convergence and oscillation	2021-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q5002624	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q5002775	2021-07-28	Paper
A Constant Factor Approximation Algorithm for Reordering Buffer Management	2019-05-15	Paper
Bicriteria approximation tradeoff for the node-cost budget problem	2018-11-05	Paper
An Improved Competitive Algorithm for Reordering Buffer Management	2018-10-30	Paper
Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration	2018-07-16	Paper
Convergence of Incentive-Driven Dynamics in Fisher Markets	2018-07-16	Paper
Error-Correcting Codes for Automatic Control	2017-08-08	Paper
On Lipschitz extension from finite subsets	2017-06-07	Paper
Learning mixtures of arbitrary distributions over large discrete domains	2017-05-19	Paper
Lower bounds for high dimensional nearest neighbor search and related problems	2016-09-29	Paper
Subquadratic approximation algorithms for clustering problems in high dimensional spaces	2016-09-29	Paper
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)	2016-09-01	Paper
Polynomial-time approximation schemes for geometric min-sum median clustering	2015-10-30	Paper
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs	2015-10-27	Paper
Learning Arbitrary Statistical Mixtures of Discrete Distributions	2015-08-21	Paper
Approximation algorithms for constrained for constrained node weighted steiner tree problems	2015-02-27	Paper
Explicit construction of a small epsilon-net for linear threshold functions	2015-02-04	Paper
On earthmover distance, metric labeling, and 0-extension	2014-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q2921763	2014-10-13	Paper
Tighter bounds for nearest neighbor search and related problems in the cell probe model	2014-09-26	Paper
An improved approximation algorithm for resource allocation	2014-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q5417601	2014-05-22	Paper
The effectiveness of lloyd-type methods for the k-means problem	2014-02-17	Paper
Unconditionally-Secure Robust Secret Sharing with Compact Shares	2012-06-29	Paper
Explicit Dimension Reduction and Its Applications	2012-05-30	Paper
Local Versus Global Properties of Metric Spaces	2012-05-30	Paper
https://portal.mardi4nfdi.de/entity/Q3113698	2012-01-23	Paper
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions	2011-04-04	Paper
Low Distortion Maps Between Point Sets	2010-09-06	Paper
Approximation schemes for clustering problems	2010-08-16	Paper
Local versus global properties of metric spaces	2010-08-16	Paper
Improved lower bounds for embeddings into L1	2010-08-16	Paper
Low distortion embeddings for edit distance	2010-08-16	Paper
Low distortion maps between point sets	2010-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q3579377	2010-08-06	Paper
On Earthmover Distance, Metric Labeling, and 0-Extension	2010-04-29	Paper
Improved Lower Bounds for Embeddings into $L_1$	2010-01-06	Paper
Competitive algorithms for distributed data management.	2008-12-21	Paper
Low distortion embeddings for edit distance	2008-12-21	Paper
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem	2008-07-15	Paper
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems	2008-05-27	Paper
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems	2008-04-22	Paper
On the hardness of approximating Multicut and Sparsest-Cut	2007-11-05	Paper
Approximation Algorithms for Graph Homomorphism Problems	2007-08-28	Paper
Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs	2005-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q5692700	2005-09-28	Paper
Approximation Algorithms for the 0-Extension Problem	2005-02-21	Paper
Subquadratic approximation algorithms for clustering problems in high dimensional spaces	2005-01-19	Paper
Cell-probe lower bounds for the partial match problem	2004-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4737541	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q2768354	2004-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4411271	2003-07-07	Paper
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model	2002-09-12	Paper
https://portal.mardi4nfdi.de/entity/Q4542519	2002-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q4542584	2002-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q2768266	2002-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q2768268	2002-06-30	Paper
Fairness in routing and load balancing	2002-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4230341	2002-01-17	Paper
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4527032	2001-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4527034	2001-03-01	Paper
An improved approximation algorithm of MULTIWAY CUT.	2000-11-21	Paper
Allocating Bandwidth for Bursty Connections	2000-10-18	Paper
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces	2000-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4228490	2000-05-18	Paper
A computational view of population genetics	1999-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q4234054	1999-03-16	Paper
Fairness in Scheduling	1999-01-17	Paper
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing	1998-10-21	Paper
Competitive Algorithms for Layered Graph Traversal	1998-09-21	Paper
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm	1998-05-10	Paper
On the Value of Coordination in Distributed Decision Making	1997-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4886092	1996-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q4886081	1996-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4875206	1996-04-28	Paper
A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle	1994-07-21	Paper
Competitive \(k\)-server algorithms	1994-06-29	Paper
A better lower bound for on-line scheduling	1994-06-15	Paper
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms	1994-05-10	Paper
On the space complexity of some algorithms for sequence comparison	1992-06-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yuval Rabani