Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1206.4377
Cited By
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
20 June 2012
F. Afrati
A. Sarma
S. Salihoglu
J. Ullman
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Upper and Lower Bounds on the Cost of a Map-Reduce Computation"
9 / 9 papers shown
Title
Engineering a Distributed-Memory Triangle Counting Algorithm
Peter Sanders
Tim Niklas Uhl
69
9
0
22 Feb 2023
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
63
18
0
07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity
Moses Charikar
Weiyun Ma
Li-Yang Tan
39
1
0
05 Jan 2020
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem
Sepehr Assadi
S. Khanna
42
16
0
09 Jan 2018
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
83
29
0
05 Nov 2017
Feature selection in high-dimensional dataset using MapReduce
C. Reggiani
Y. Borgne
Gianluca Bontempi
23
17
0
07 Sep 2017
A Survey on Geographically Distributed Big-Data Processing using MapReduce
Shlomi Dolev
Patricia Florissi
E. Gudes
Shantanu Sharma
Ido Singer
AI4TS
FedML
121
67
0
06 Jul 2017
Security and Privacy Aspects in MapReduce on Clouds: A Survey
Philip Derbeko
Shlomi Dolev
E. Gudes
Shantanu Sharma
48
87
0
02 May 2016
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
Matteo Ceccarello
Francesco Silvestri
54
7
0
12 Aug 2014
1