32 citations · 140 across the 32 of their papers we have counts for
3 papers · 1 filter
Dynamic Algorithms for the Massively Parallel Computation Model
Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni +1
The Massive Parallel Computing (MPC) model gained popularity during the last decade and it is now seen as the standard model for processing large scale data. One significant shortc…
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam +2
Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a mono…
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond
MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin +1
Distributed processing frameworks, such as MapReduce, Hadoop, and Spark are popular systems for processing large amounts of data. The design of efficient algorithms in these framew…