| 2009 |
|---|
| 78 | EE | Yuval Rabani,
Gabriel Scalosub:
Bicriteria approximation tradeoff for the node-cost budget problem.
ACM Transactions on Algorithms 5(2): (2009) |
| 77 | EE | Robert Krauthgamer,
Yuval Rabani:
Improved Lower Bounds for Embeddings intoL1$.
SIAM J. Comput. 38(6): 2487-2498 (2009) |
| 2008 |
|---|
| 76 | EE | Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies.
SODA 2008: 671-680 |
| 75 | EE | Yuval Rabani,
Gabriel Scalosub:
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem.
SWAT 2008: 90-101 |
| 2007 |
|---|
| 74 | EE | Rafail Ostrovsky,
Yuval Rabani:
Low distortion embeddings for edit distance.
J. ACM 54(5): (2007) |
| 73 | EE | Anna Moss,
Yuval Rabani:
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems.
SIAM J. Comput. 37(2): 460-481 (2007) |
| 2006 |
|---|
| 72 | EE | Michael Langberg,
Yuval Rabani,
Chaitanya Swamy:
Approximation Algorithms for Graph Homomorphism Problems.
APPROX-RANDOM 2006: 176-187 |
| 71 | EE | Rafail Ostrovsky,
Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem.
FOCS 2006: 165-176 |
| 70 | EE | Robert Krauthgamer,
Yuval Rabani:
Improved lower bounds for embeddings into L1.
SODA 2006: 1010-1017 |
| 69 | EE | 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 |
| 68 | EE | Howard J. Karloff,
Subhash Khot,
Aranyak Mehta,
Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension.
STOC 2006: 547-556 |
| 67 | EE | 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) |
| 2005 |
|---|
| 66 | EE | Rafail Ostrovsky,
Yuval Rabani,
Leonard J. Schulman:
Error-Correcting Codes for Automatic Control.
FOCS 2005: 309-316 |
| 65 | EE | 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 | EE | Julia Chuzhoy,
Yuval Rabani:
Approximating k-median with non-uniform capacities.
SODA 2005: 952-958 |
| 63 | EE | Rafail Ostrovsky,
Yuval Rabani:
Low distortion embeddings for edit distance.
STOC 2005: 218-224 |
| 62 | EE | Joseph Cheriyan,
Howard J. Karloff,
Yuval Rabani:
Approximating Directed Multicuts.
Combinatorica 25(3): 251-269 (2005) |
| 61 | EE | 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 | EE | Claire Kenyon,
Yuval Rabani,
Alistair Sinclair:
Low distortion maps between point sets.
STOC 2004: 272-280 |
| 59 | EE | 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 | EE | 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 | EE | 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 | EE | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
Approximation Algorithms for the 0-Extension Problem.
SIAM J. Comput. 34(2): 358-372 (2004) |
| 2003 |
|---|
| 55 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon,
Yuval Rabani:
Approximation schemes for clustering problems.
STOC 2003: 50-58 |
| 54 | EE | T. S. Jayram,
Subhash Khot,
Ravi Kumar,
Yuval Rabani:
Cell-probe lower bounds for the partial match problem.
STOC 2003: 667-672 |
| 2002 |
|---|
| 53 | EE | Yuval Rabani:
Search and Classification of High Dimensional Data.
APPROX 2002: 1-2 |
| 52 | EE | Gruia Calinescu,
Amit Chakrabarti,
Howard J. Karloff,
Yuval Rabani:
Improved Approximation Algorithms for Resource Allocation.
IPCO 2002: 401-414 |
| 51 | EE | 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 | EE | Rafail Ostrovsky,
Yuval Rabani:
Polynomial-time approximation schemes for geometric min-sum median clustering.
J. ACM 49(2): 139-156 (2002) |
| 49 | EE | 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 | EE | Joseph Naor,
Yuval Rabani:
Tree packing and approximating k-cuts.
SODA 2001: 26-27 |
| 45 | EE | Allan Borodin,
Rafail Ostrovsky,
Yuval Rabani:
Stability preserving transformations: packet routing networks with edge capacities and speeds.
SODA 2001: 601-610 |
| 44 | EE | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
Approximation algorithms for the 0-extension problem.
SODA 2001: 8-16 |
| 43 | EE | 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 | EE | 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 | EE | 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 | EE | Jon M. Kleinberg,
Yuval Rabani,
Éva Tardos:
Fairness in Routing and Load Balancing.
FOCS 1999: 568-578 |
| 34 | EE | Allan Borodin,
Rafail Ostrovsky,
Yuval Rabani:
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems.
STOC 1999: 312-321 |
| 33 | EE | Allan Borodin,
Rafail Ostrovsky,
Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.
STOC 1999: 435-444 |
| 1998 |
|---|
| 32 | EE | Yuval Rabani,
Alistair Sinclair,
Rolf Wanka:
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes.
FOCS 1998: 694-705 |
| 31 | EE | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
An Improved Approximation Algorithm for Multiway Cut.
STOC 1998: 48-52 |
| 30 | EE | 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 | EE | Rafail Ostrovsky,
Yuval Rabani:
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms.
STOC 1997: 644-653 |
| 23 | EE | Jon M. Kleinberg,
Yuval Rabani,
Éva Tardos:
Allocating Bandwidth for Bursty Connections.
STOC 1997: 664-673 |
| 22 | EE | 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 | EE | 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 | EE | 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 | EE | 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 |
