Yuval Rabani

	2009
80		Yuval Rabani, Amir Shpilka: Explicit construction of a small epsilon-net for linear threshold functions. STOC 2009: 649-658
79		Yuval Rabani, Gabriel Scalosub: Bicriteria approximation tradeoff for the node-cost budget problem. ACM Transactions on Algorithms 5(2): (2009)
78		Robert Krauthgamer, Yuval Rabani: Improved Lower Bounds for Embeddings intoL1$. SIAM J. Comput. 38(6): 2487-2498 (2009)
	2008
77		Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: Approximation algorithms for labeling hierarchical taxonomies. SODA 2008: 671-680
76		Yuval Rabani, Gabriel Scalosub: Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem. SWAT 2008: 90-101
	2007
75		Rafail Ostrovsky, Yuval Rabani: Low distortion embeddings for edit distance. J. ACM 54(5): (2007)
74		Anna Moss, Yuval Rabani: Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems. SIAM J. Comput. 37(2): 460-481 (2007)
	2006
73		Michael Langberg, Yuval Rabani, Chaitanya Swamy: Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187
72		Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176
71		Robert Krauthgamer, Yuval Rabani: Improved lower bounds for embeddings into L1. SODA 2006: 1010-1017
70		Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala: Local versus global properties of metric spaces. SODA 2006: 41-50
69		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556
68		Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar: On the Hardness of Approximating Multicut and Sparsest-Cut. Computational Complexity 15(2): 94-114 (2006)
67		Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006)
	2005
66		Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman: Error-Correcting Codes for Automatic Control. FOCS 2005: 309-316
65		Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar: On the Hardness of Approximating Multicut and Sparsest-Cut. IEEE Conference on Computational Complexity 2005: 144-153
64		Julia Chuzhoy, Yuval Rabani: Approximating k-median with non-uniform capacities. SODA 2005: 952-958
63		Rafail Ostrovsky, Yuval Rabani: Low distortion embeddings for edit distance. STOC 2005: 218-224
62		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. Combinatorica 25(3): 251-269 (2005)
61		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension Electronic Colloquium on Computational Complexity (ECCC)(064): (2005)
	2004
60		Claire Kenyon, Yuval Rabani, Alistair Sinclair: Low distortion maps between point sets. STOC 2004: 272-280
59		T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004)
58		Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. Journal of Interconnection Networks 5(1): 1-12 (2004)
57		Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. Machine Learning 56(1-3): 153-167 (2004)
56		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004)
	2003
55		Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani: Approximation schemes for clustering problems. STOC 2003: 50-58
54		T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672
	2002
53		Yuval Rabani: Search and Classification of High Dimensional Data. APPROX 2002: 1-2
52		Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani: Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414
51		Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani: Polynomial Time Approximation Schemes for Metric Min-Sum Clustering Electronic Colloquium on Computational Complexity (ECCC)(025): (2002)
50		Rafail Ostrovsky, Yuval Rabani: Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2): 139-156 (2002)
49		Omer Barkol, Yuval Rabani: Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model. J. Comput. Syst. Sci. 64(4): 873-896 (2002)
	2001
48		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. FOCS 2001: 320-328
47		Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356
46		Joseph Naor, Yuval Rabani: Tree packing and approximating k-cuts. SODA 2001: 26-27
45		Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Stability preserving transformations: packet routing networks with edge capacities and speeds. SODA 2001: 601-610
44		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation algorithms for the 0-extension problem. SODA 2001: 8-16
43		Anna Moss, Yuval Rabani: Approximation algorithms for constrained for constrained node weighted steiner tree problems. STOC 2001: 373-382
42		Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001)
	2000
41		Rafail Ostrovsky, Yuval Rabani: Polynomial Time Approximation Schemes for Geometric k-Clustering. FOCS 2000: 349-358
40		Omer Barkol, Yuval Rabani: Tighter bounds for nearest neighbor search and related problems in the cell probe model. STOC 2000: 388-396
39		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000)
38		Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000)
37		Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000)
36		Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks: A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM J. Comput. 30(5): 1624-1661 (2000)
	1999
35		Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. FOCS 1999: 568-578
34		Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. STOC 1999: 312-321
33		Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. STOC 1999: 435-444
	1998
32		Yuval Rabani, Alistair Sinclair, Rolf Wanka: Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS 1998: 694-705
31		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52
30		Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623
29		Claire Kenyon, Yuval Rabani, Alistair Sinclair: Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27(2): 218-235 (1998)
28		Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts: Fairness in Scheduling J. Algorithms 29(2): 306-357 (1998)
27		Yuval Rabani, Yuri Rabinovich, Alistair Sinclair: A computational view of population genetics. Random Struct. Algorithms 12(4): 313-334 (1998)
26		Yonatan Aumann, Yuval Rabani: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM J. Comput. 27(1): 291-301 (1998)
25		Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28(2): 447-462 (1998)
	1997
24		Rafail Ostrovsky, Yuval Rabani: Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms. STOC 1997: 644-653
23		Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673
22		Allan Borodin, Yuval Rabani, Baruch Schieber: Deterministic Many-to-Many Hot Potato Routing. IEEE Trans. Parallel Distrib. Syst. 8(6): 587-596 (1997)
	1996
21		Yuval Rabani: Path Coloring on the Mesh. FOCS 1996: 400-409
20		Claire Kenyon, Yuval Rabani, Alistair Sinclair: Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA 1996: 351-358
19		Yuval Rabani, Éva Tardos: Distributed Packet Switching in Arbitrary Networks. STOC 1996: 366-375
18		Sandy Irani, Yuval Rabani: On the Value of Coordination in Distributed Decision Making. SIAM J. Comput. 25(3): 498-519 (1996)
	1995
17		Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts: Fairness in Scheduling. SODA 1995: 477-485
16		Yonatan Aumann, Yuval Rabani: Improved Bounds for All Optical Routing. SODA 1995: 567-576
15		Yuval Rabani, Yuri Rabinovich, Alistair Sinclair: A computational view of population genetics. STOC 1995: 83-92
14		Yair Bartal, Amos Fiat, Yuval Rabani: Competitive Algorithms for Distributed Data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995)
	1994
13		Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani: On-line Admission Control and Circuit Routing for High Performance Computing and Communication FOCS 1994: 412-423
12		Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani: Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). STOC 1994: 459-467
11		Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber: A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. Algorithmica 11(6): 572-578 (1994)
10		Yair Bartal, Howard J. Karloff, Yuval Rabani: A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994)
9		Amos Fiat, Yuval Rabani, Yiftach Ravid: Competitive k-Server Algorithms. J. Comput. Syst. Sci. 48(3): 410-428 (1994)
8		Howard J. Karloff, Yuval Rabani, Yiftach Ravid: Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. SIAM J. Comput. 23(2): 293-312 (1994)
	1993
7		Sandy Irani, Yuval Rabani: On the Value of Information in Coordination Games (preliminary version) FOCS 1993: 12-21
	1992
6		Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks: A Decomposition Theorem and Bounds for Randomized Server Problems FOCS 1992: 197-207
5		Yair Bartal, Amos Fiat, Yuval Rabani: Competitive Algorithms for Distributed Data Management (Extended Abstract) STOC 1992: 39-50
4		Yuval Rabani, Zvi Galil: On the Space Complexity of Some Algorithms for Sequence Comparison. Theor. Comput. Sci. 95(2): 231-244 (1992)
	1991
3		Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal FOCS 1991: 288-297
2		Howard J. Karloff, Yuval Rabani, Yiftach Ravid: Lower Bounds for Randomized k-Server and Motion Planning Algorithms STOC 1991: 278-288
	1990
1		Amos Fiat, Yuval Rabani, Yiftach Ravid: Competitive k-Server Algorithms (Extended Abstract) FOCS 1990: 454-463

Coauthor Index

1	Miklós Ajtai	[17] [28]
2	Sanjeev Arora	[12] [70]
3	James Aspnes	[17] [28]
4	Yonatan Aumann	[16] [26]
5	Baruch Awerbuch	[13]
6	Omer Barkol	[40] [49]
7	Yair Bartal	[5] [10] [14]
8	Avrim Blum	[6] [36]
9	Allan Borodin	[22] [33] [34] [45] [57] [58]
10	Gruia Calinescu	[31] [39] [44] [52] [56]
11	Amit Chakrabarti	[52]
12	Shuchi Chawla	[65] [68]
13	Joseph Cheriyan	[48] [62]
14	Julia Chuzhoy	[47] [64] [67]
15	Amos Fiat	[1] [3] [5] [9] [11] [14] [25]
16	Dean P. Foster	[3] [25]
17	Zvi Galil	[4]
18	Rainer Gawlick	[13]
19	Sandy Irani	[7] [18]
20	T. S. Jayram (Jayram S. Thathachar)	[54] [59]
21	Howard J. Karloff	[2] [3] [6] [8] [10] [25] [31] [36] [39] [44] [48] [52] [56] [61] [62] [69]
22	Marek Karpinski	[51] [55]
23	Subhash Khot	[54] [59] [61] [69]
24	Jon M. Kleinberg	[23] [35] [38] [42]
25	Robert Krauthgamer	[65] [68] [71] [78]
26	Ravi Kumar (S. Ravi Kumar)	[54] [59] [65] [68]
27	Eyal Kushilevitz	[30] [37]
28	Michael Langberg	[73]
29	Frank Thomson Leighton (Tom Leighton)	[13]
30	László Lovász	[70]
31	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[20] [29] [51] [55] [60]
32	Aranyak Mehta	[61] [69]
33	Anna Moss	[43] [74]
34	Joseph Naor (Seffi Naor)	[46]
35	Moni Naor	[17] [28]
36	Ilan Newman	[70]
37	Rafail Ostrovsky	[24] [30] [33] [34] [37] [41] [45] [47] [50] [57] [58] [63] [66] [67] [72] [75]
38	Yuri Rabinovich	[15] [27] [70]
39	Yiftach Ravid	[1] [2] [3] [8] [9] [11] [25]
40	Michael E. Saks	[6] [36]
41	Gabriel Scalosub	[76] [79]
42	Baruch Schieber	[11] [22]
43	Leonard J. Schulman	[17] [28] [66] [72] [77]
44	Amir Shpilka	[80]
45	Alistair Sinclair	[15] [20] [27] [29] [32] [60]
46	D. Sivakumar	[65] [68]
47	Chaitanya Swamy	[72] [73] [77]
48	Éva Tardos	[19] [23] [35] [38] [42]
49	Umesh V. Vazirani	[12]
50	Wenceslas Fernandez de la Vega	[51] [55]
51	Santosh Vempala	[70]
52	Sundar Vishwanathan	[3] [25]
53	Orli Waarts	[17] [28]
54	Rolf Wanka	[32]

Colors in the list of coauthors