| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Noa Avigdor-Elgrabli, Yuval Rabani |
A Constant Factor Approximation Algorithm for Reordering Buffer Management  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala |
Local Versus Global Properties of Metric Spaces.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani (eds.) |
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani |
Unconditionally-Secure Robust Secret Sharing with Compact Shares.  |
EUROCRYPT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
An improved approximation algorithm for resource allocation.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications.  |
IEEE Conference on Computational Complexity  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Rafail Ostrovsky, Yuval Rabani |
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Rabani, Amir Shpilka |
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions.  |
SIAM J. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani |
Monotonicity in Bargaining Networks.  |
SODA  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Noa Avigdor-Elgrabli, Yuval Rabani |
An Improved Competitive Algorithm for Reordering Buffer Management.  |
SODA  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuval Rabani, Gabriel Scalosub |
Bicriteria approximation tradeoff for the node-cost budget problem.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, bicriteria approximation |
| 1 | Robert Krauthgamer, Yuval Rabani |
Improved Lower Bounds for Embeddings intoL1$.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Yuval Rabani, Alistair Sinclair |
Low Distortion Maps Between Point Sets.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On Earthmover Distance, Metric Labeling, and 0-Extension.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman |
Error-correcting codes for automatic control.  |
IEEE Transactions on Information Theory  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Amir Shpilka |
Explicit construction of a small epsilon-net for linear threshold functions.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
linear threshold function, explicit construction, epsilon-net |
| 1 | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
Approximation algorithms for labeling hierarchical taxonomies.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Gabriel Scalosub |
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem.  |
SWAT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani |
Low distortion embeddings for edit distance.  |
J. ACM  |
2007 |
DBLP DOI BibTeX RDF |
Pattern matching, sketching, communication complexity, edit distance, dimension reduction, nearest neighbor search, metric embeddings, Levenshtein distance, computations on discrete structures |
| 1 | Anna Moss, Yuval Rabani |
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems.  |
SIAM J. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.  |
Math. Oper. Res.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar |
On the Hardness of Approximating Multicut and Sparsest-Cut.  |
Computational Complexity  |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala |
Local versus global properties of metric spaces.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, Yuval Rabani |
Improved lower bounds for embeddings into L1.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Yuval Rabani, Chaitanya Swamy |
Approximation Algorithms for Graph Homomorphism Problems.  |
APPROX-RANDOM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
The Effectiveness of Lloyd-Type Methods for the k-Means Problem.  |
FOCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts.  |
Combinatorica  |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25 |
| 1 | Julia Chuzhoy, Yuval Rabani |
Approximating k-median with non-uniform capacities.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman |
Error-Correcting Codes for Automatic Control.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani |
Low distortion embeddings for edit distance.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
low distortion embeddings, edit distance, metric spaces |
| 1 | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds.  |
Journal of Interconnection Networks  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.  |
Machine Learning  |
2004 |
DBLP DOI BibTeX RDF |
graph-theoretic clustering, sparse partitions, high dimensional spaces |
| 1 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani |
Cell-probe lower bounds for the partial match problem.  |
J. Comput. Syst. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation Algorithms for the 0-Extension Problem.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Yuval Rabani, Alistair Sinclair |
Low distortion maps between point sets.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
low distortion embeddings, dynamic programming, metric spaces, shape matching |
| 1 | Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani |
Approximation schemes for clustering problems.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani |
Cell-probe lower bounds for the partial match problem.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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)  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani |
Polynomial-time approximation schemes for geometric min-sum median clustering.  |
J. ACM  |
2002 |
DBLP DOI BibTeX RDF |
Clustering, high-dimensional data, polynomial-time approximation schemes |
| 1 | Omer Barkol, Yuval Rabani |
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model.  |
J. Comput. Syst. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
Improved Approximation Algorithms for Resource Allocation.  |
IPCO  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Yuval Rabani |
Search and Classification of High Dimensional Data.  |
APPROX  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Fairness in Routing and Load Balancing.  |
J. Comput. Syst. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Naor, Yuval Rabani |
Tree packing and approximating k-cuts.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
Stability preserving transformations: packet routing networks with edge capacities and speeds.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation algorithms for the 0-extension problem.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.  |
FOCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts.  |
FOCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Moss, Yuval Rabani |
Approximation algorithms for constrained for constrained node weighted steiner tree problems.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for MULTIWAY CUT.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Allocating Bandwidth for Bursty Connections.  |
SIAM J. Comput.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani |
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.  |
SIAM J. Comput.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani |
Polynomial Time Approximation Schemes for Geometric k-Clustering.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
geometric k-clustering, data point clustering, data set partitioning, high dimensional geometry, binary cube, computational complexity, computational geometry, Hamming distance, NP-hard problem, distance function, polynomial time approximation schemes, pattern clustering, k-median problem |
| 1 | Omer Barkol, Yuval Rabani |
Tighter bounds for nearest neighbor search and related problems in the cell probe model.  |
STOC  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Fairness in Routing and Load Balancing.  |
FOCS  |
1999 |
DBLP DOI BibTeX RDF |
load balancing, Network routing, bandwidth allocation, maximum flow, max-min fairness, unsplittable flow |
| 1 | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems.  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Yuri Rabinovich, Alistair Sinclair |
A computational view of population genetics.  |
Random Struct. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Yuval Rabani, Alistair Sinclair |
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing.  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts |
Fairness in Scheduling  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
Competitive Algorithms for Layered Graph Traversal.  |
SIAM J. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Yuval Rabani |
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm.  |
SIAM J. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Alistair Sinclair, Rolf Wanka |
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes.  |
FOCS  |
1998 |
DBLP DOI BibTeX RDF |
Balancing Circuits, Local Divergence, Load Balancing, Diffusion |
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani |
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
Database Manager |
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for Multiway Cut.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Yuval Rabani, Baruch Schieber |
Deterministic Many-to-Many Hot Potato Routing.  |
IEEE Trans. Parallel Distrib. Syst.  |
1997 |
DBLP DOI BibTeX RDF |
many-to-many routing, Routing, hypercube, mesh, deflection routing |
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Allocating Bandwidth for Bursty Connections.  |
STOC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Yuval Rabani |
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms.  |
STOC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandy Irani, Yuval Rabani |
On the Value of Coordination in Distributed Decision Making.  |
SIAM J. Comput.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Yuval Rabani, Alistair Sinclair |
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani |
Path Coloring on the Mesh.  |
FOCS  |
1996 |
DBLP DOI BibTeX RDF |
minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring |
| 1 | Yuval Rabani, Éva Tardos |
Distributed Packet Switching in Arbitrary Networks.  |
STOC  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Amos Fiat, Yuval Rabani |
Competitive Algorithms for Distributed Data Management.  |
J. Comput. Syst. Sci.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Yuval Rabani |
Improved Bounds for All Optical Routing.  |
SODA  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts |
Fairness in Scheduling.  |
SODA  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Yuri Rabinovich, Alistair Sinclair |
A computational view of population genetics.  |
STOC  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Howard J. Karloff, Yuval Rabani |
A Better Lower Bound for On-Line Scheduling.  |
Inf. Process. Lett.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber |
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.  |
Algorithmica  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Yuval Rabani, Yiftach Ravid |
Competitive k-Server Algorithms.  |
J. Comput. Syst. Sci.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Yuval Rabani, Yiftach Ravid |
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.  |
SIAM J. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani |
On-line Admission Control and Circuit Routing for High Performance Computing and Communication  |
FOCS  |
1994 |
DBLP DOI BibTeX RDF |
greedy-based approaches, on-line admission control, circuit routing, high performance communication, virtual circuit routing, real-lime database servers, lower bounds, high performance computing, hypercubes, trees, upper bounds, optimal algorithms, arrays, video-servers |
| 1 | Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani |
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version).  |
STOC  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandy Irani, Yuval Rabani |
On the Value of Information in Coordination Games (preliminary version)  |
FOCS  |
1993 |
DBLP DOI BibTeX RDF |
maximum out-degree, coordination games, virtual circuit routing, load balancing, directed graph, distributed artificial intelligence |
| 1 | Yuval Rabani, Zvi Galil |
On the Space Complexity of Some Algorithms for Sequence Comparison.  |
Theor. Comput. Sci.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks |
A Decomposition Theorem and Bounds for Randomized Server Problems  |
FOCS  |
1992 |
DBLP DOI BibTeX RDF |
randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem |
| 1 | Yair Bartal, Amos Fiat, Yuval Rabani |
Competitive Algorithms for Distributed Data Management (Extended Abstract)  |
STOC  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
Competitive Algorithms for Layered Graph Traversal  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
deterministic online algorithm, layered graph traversal, searcher, target vertex, lower bounds, upper bounds, weighted graph, competitive algorithms |
| 1 | Howard J. Karloff, Yuval Rabani, Yiftach Ravid |
Lower Bounds for Randomized k-Server and Motion Planning Algorithms  |
STOC  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Yuval Rabani, Yiftach Ravid |
Competitive k-Server Algorithms (Extended Abstract)  |
FOCS  |
1990 |
DBLP DOI BibTeX RDF |
k-taxicab, competitive k-server algorithms, three-server randomized competitive algorithm, nonconstructive proof, natural generalization, metric spaces |