The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yuval Rabani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. Approximation algorithms for labeling hierarchical taxonomies. [Citation Graph (, )][DBLP]


  76. Monotonicity in Bargaining Networks. [Citation Graph (, )][DBLP]


  77. An Improved Competitive Algorithm for Reordering Buffer Management. [Citation Graph (, )][DBLP]


  78. Explicit construction of a small epsilon-net for linear threshold functions. [Citation Graph (, )][DBLP]


  79. Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem. [Citation Graph (, )][DBLP]


Search in 0.028secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002