Yuval Rabani
Yuval Rabani
The Hebrew University of Jerusalem
Bestätigte E-Mail-Adresse bei cs.huji.ac.il - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Efficient search for approximate nearest neighbor in high dimensional spaces
E Kushilevitz, R Ostrovsky, Y Rabani
SIAM Journal on Computing 30 (2), 457-474, 2000
6412000
The effectiveness of Lloyd-type methods for the k-means problem
R Ostrovsky, Y Rabani, LJ Schulman, C Swamy
Journal of the ACM (JACM) 59 (6), 1-22, 2013
4842013
An O (log k) approximate min-cut max-flow theorem and approximation algorithm
Y Aumann, Y Rabani
SIAM Journal on Computing 27 (1), 291-301, 1998
3011998
Competitive algorithms for distributed data management
Y Bartal, A Fiat, Y Rabani
Journal of Computer and System Sciences 51 (3), 341-358, 1995
2741995
Fairness in routing and load balancing
J Kleinberg, Y Rabani, É Tardos
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
2631999
An improved approximation algorithm for multiway cut
G Călinescu, H Karloff, Y Rabani
Proceedings of the thirtieth annual ACM symposium on Theory of computing, 48-52, 1998
2621998
On the hardness of approximating multicut and sparsest-cut
S Chawla, R Krauthgamer, R Kumar, Y Rabani, D Sivakumar
computational complexity 15 (2), 94-114, 2006
2332006
Allocating bandwidth for bursty connections
J Kleinberg, Y Rabani, É Tardos
SIAM Journal on Computing 30 (1), 191-217, 2000
2102000
Approximation schemes for clustering problems
WF De La Vega, M Karpinski, C Kenyon, Y Rabani
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
205*2003
Competitive k-server algorithms
A Fiat, Y Rabani, Y Ravid
Journal of Computer and System Sciences 48 (3), 410-428, 1994
1771994
Approximation algorithms for the 0-extension problem
G Calinescu, H Karloff, Y Rabani
SIAM Journal on Computing 34 (2), 358-372, 2005
1682005
On-line admission control and circuit routing for high performance computing and communication
B Awerbuch, R Gawlick, T Leighton, Y Rabani
Proceedings 35th Annual Symposium on Foundations of Computer Science, 412-423, 1994
1511994
Improved bounds for all optical routing
Y Aumann, Y Rabani
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995
1501995
Local divergence of Markov chains and the analysis of iterative load-balancing schemes
Y Rabani, A Sinclair, R Wanka
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
1441998
Lower bounds for high dimensional nearest neighbor search and related problems
A Borodin, R Ostrovsky, Y Rabani
Discrete and Computational Geometry, 253-274, 2003
141*2003
An improved approximation algorithm for resource allocation
G Calinescu, A Chakrabarti, H Karloff, Y Rabani
ACM Transactions on Algorithms (TALG) 7 (4), 1-7, 2011
135*2011
Polynomial time approximation schemes for geometric k-clustering
R Ostrovsky, Y Rabani
Proceedings 41st Annual Symposium on Foundations of Computer Science, 349-358, 2000
131*2000
Approximation algorithms for the job interval selection problem and related scheduling problems
J Chuzhoy, R Ostrovsky, Y Rabani
Mathematics of Operations Research 31 (4), 730-738, 2006
1182006
A Computational View of Population Genetics
Y Rabani, Y Rabinovich, A Sinclair
1181998
Low distortion embeddings for edit distance
R Ostrovsky, Y Rabani
Journal of the ACM (JACM) 54 (5), 23-es, 2007
1132007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20