Searching for authors named "Yuval Rabani" – sorted by Relevance.
-
Path Coloring on the Mesh
- Path Coloring on the Mesh Yuval Rabani Abstract In the minimum path coloring problem, we
- Cited by 25 (0 self) – Add To MetaCart
-
General Temrs
- Low Distortion Embeddings for Edit Distance * Rafail Ostrovsky# Yuval Rabani## August 19, 2005
- Add To MetaCart
-
Distributed Packet Switching in Arbitrary Networks
- Distributed Packet Switching in Arbitrary Networks Yuval Rabani ' Eva Tardos y The Technion
- Cited by 32 (3 self) – Add To MetaCart
-
Low distortion embeddings for edit distance
- Low Distortion Embeddings for Edit Distance ∗ Rafail Ostrovsky † Yuval Rabani ‡ December 20, 2005
- Cited by 12 (1 self) – Add To MetaCart
-
Approximating k-median with non-uniform capacities
- Approximating k-Median with Non-Uniform Capacities Julia Chuzhoy ∗ Yuval Rabani † Abstract
- Cited by 5 (0 self) – Add To MetaCart
-
Approximating directed multicuts
- AT&T Labs--Research 180 Park Ave.Florham Park, NJ 07932 howard@(email omitted); Yuval Rabani y Computer
- Cited by 10 (0 self) – Add To MetaCart
-
On the Value of Coordination in Distributed Decision Making
- On the Value of Coordination in Distributed Decision Making Sandy Irani y Yuval Rabani z
- Cited by 1 (0 self) – Add To MetaCart
-
Improved lower bounds for embeddings into l1
- Improved lower bounds for embeddings into L1 ∗ Robert Krauthgamer † Yuval Rabani ‡ May 16, 2006
- Cited by 17 (3 self) – Add To MetaCart
-
An O(log k) approximate min-cut max-flow theorem and approximation algorithm
- AUMANN † AND YUVAL RABANI ‡ Abstract. It is shown that the minimum cut ratio is within a factor of O
- Cited by 97 (8 self) – Add To MetaCart
-
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
- Barkol ∗ Yuval Rabani † Abstract We prove new lower bounds for nearest neighbor search in the Hamming
- Cited by 9 (0 self) – Add To MetaCart

