8 citations · 15 across the 6 of their papers we have counts for
15 papers
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1
Streaming computation plays an important role in large-scale data analysis. The sliding window model is a model of streaming computation which also captures the recency of the data…
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1
In this paper, we study the -gather problem, a natural formulation of minimum-size clustering in metric spaces. The goal of -gather is to partition points into clusters s…
Average Case Column Subset Selection for Entrywise -Norm Loss
Zhao Song, David P. Woodruff, Peilin Zhong
We study the column subset selection problem with respect to the entrywise -norm loss. It is known that in the worst case, to obtain a good rank- approximation to a matr…
Connected Components on a PRAM in Log Diameter Time
S. Cliff Liu, Robert E. Tarjan, Peilin Zhong
We present an -time randomized PRAM algorithm for computing the connected components of an -vertex, -edge undirected graph with maximum componen…
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Alexandr Andoni, Clifford Stein, Peilin Zhong
We present a -approximate parallel algorithm for computing shortest paths in undirected graphs, achieving depth and $m\mathrm{poly}(\log n)…
Efficient Symmetric Norm Regression via Linear Sketching
Zhao Song, Ruosong Wang, Lin F. Yang +2
We provide efficient algorithms for overconstrained linear regression problems with size when the loss function is a symmetric norm (a norm invariant under sign-flips…