187 citations
- Carnegie Mellon UniversityUS2 papers
- Microsoft (United States)US2 papers
- Baidu (China)CN1 paper
- Bar-Ilan UniversityIL1 paper
- Ben-Gurion University of the NegevIL1 paper
- Concern Worldwide UKGB1 paper
- Concern Worldwide USUS1 paper
- Cornell UniversityUS1 paper
- ETH ZurichCH1 paper
- FORTH Institute of Computer ScienceGR1 paper
- Georgia Institute of TechnologyUS1 paper
- Hewlett Packard Enterprise (United States)US1 paper
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018★ 3 cited
AnchorHash: A Scalable Consistent Hash
Gal Mendelson, Shay Vargaftik, Katherine Barabash +3
Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solut…
cs.DS2017
Metric Embedding via Shortest Path Decompositions
Ittai Abraham, Arnold Filtser, Anupam Gupta +1
We study the problem of embedding shortest-path metrics of weighted graphs into spaces. We introduce a new embedding technique based on low-depth decompositions of a graph…
cs.DS2016★ 22 cited
On Fully Dynamic Graph Sparsifiers
Ittai Abraham, David Durfee, Ioannis Koutis +2
We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polyl…