Alexandr Andoni

activity

20082026

most citedPractical and Optimal LSH for Angular Distance

209 citations · 414 across the 29 of their papers we have counts for

collaborators

Showing 2019 · cs.DSShow all

2 papers · 2 filters

cs.DS2019★ 4 cited

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Alexandr Andoni, Clifford Stein, Peilin Zhong

We present a $(1 + ε)$ -approximate parallel algorithm for computing shortest paths in undirected graphs, achieving $poly (lo g n)$ depth and $m\mathrm{poly}(\log n)…

cs.DS2019

Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge Connectivity

Alexandr Andoni, Clifford Stein, Peilin Zhong

Many modern parallel systems, such as MapReduce, Hadoop and Spark, can be modeled well by the MPC model. The MPC model captures well coarse-grained computation on large data --- da…

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity

Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge Connectivity