BibSLEIGH — Yuval

Travelled to:

1 × Greece
1 × Japan
13 × USA
2 × Canada

Collaborated with:

R.Ostrovsky H.J.Karloff É.Tardos A.Sinclair A.Borodin C.Kenyon A.Shpilka S.Khot A.Moss O.Barkol G.Calinescu E.Kushilevitz J.M.Kleinberg Y.Rabinovich S.Arora U.V.Vazirani Y.Bartal A.Fiat Y.Ravid N.Avigdor-Elgrabli S.Im B.Moseley J.Li L.J.Schulman C.Swamy A.Mehta T.S.Jayram R.Kumar W.F.d.l.Vega M.Karpinski

Talks about:

algorithm (6) problem (6) approxim (5) bound (4) distribut (3) dimension (3) neighbor (3) nearest (3) search (3) lower (3)

Person: Yuval Rabani

DBLP: Rabani:Yuval

Contributed to:

2015

2009

2006

2005

2004

2003

2001

2000

1999

1998

1997

1996

1995

1994

1992

1991

Wrote 21 papers:

ICALP-v1-2015-Avigdor-Elgrabli #on the #order #random: On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (NAE, SI, BM, YR), pp. 78–90.
STOC-2015-LiRSS #learning #statistics: Learning Arbitrary Statistical Mixtures of Discrete Distributions (JL, YR, LJS, CS), pp. 743–752.
STOC-2009-RabaniS #linear: Explicit construction of a small epsilon-net for linear threshold functions (YR, AS), pp. 649–658.
STOC-2006-KarloffKMR #distance #metric #on the: On earthmover distance, metric labeling, and 0-extension (HJK, SK, AM, YR), pp. 547–556.
STOC-2005-OstrovskyR #distance #edit distance: Low distortion embeddings for edit distance (RO, YR), pp. 218–224.
STOC-2004-KenyonRS #set: Low distortion maps between point sets (CK, YR, AS), pp. 272–280.
STOC-2003-JayramKKR #bound #problem: Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
STOC-2003-VegaKKR #approximate #clustering #problem: Approximation schemes for clustering problems (WFdlV, MK, CK, YR), pp. 50–58.
STOC-2001-MossR #algorithm #approximate #problem: Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
STOC-2000-BarkolR #bound #nearest neighbour #problem: Tighter bounds for nearest neighbor search and related problems in the cell probe model (OB, YR), pp. 388–396.
STOC-1999-BorodinOR #bound #nearest neighbour #problem: Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
STOC-1999-BorodinOR99a #algorithm #approximate #clustering #problem: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
STOC-1998-CalinescuKR #algorithm #approximate #multi: An Improved Approximation Algorithm for Multiway Cut (GC, HJK, YR), pp. 48–52.
STOC-1998-KushilevitzOR #approximate #nearest neighbour #performance: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (EK, RO, YR), pp. 614–623.
STOC-1997-KleinbergRT: Allocating Bandwidth for Bursty Connections (JMK, YR, ÉT), pp. 664–673.
STOC-1997-OstrovskyR #algorithm: Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms (RO, YR), pp. 644–653.
STOC-1996-RabaniT #distributed #network: Distributed Packet Switching in Arbitrary Networks (YR, ÉT), pp. 366–375.
STOC-1995-RabaniRS: A computational view of population genetics (YR, YR, AS), pp. 83–92.
STOC-1994-AroraRV #polynomial #simulation: Simulating quadratic dynamical systems is PSPACE-complete (SA, YR, UVV), pp. 459–467.
STOC-1992-BartalFR #algorithm #data transformation #distributed: Competitive Algorithms for Distributed Data Management (YB, AF, YR), pp. 39–50.
STOC-1991-KarloffRR #algorithm #bound #random: Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.