On the computational complexity of MapReduce
From MaRDI portal
Publication:1664122
DOI10.1007/978-3-662-48653-5_1zbMath1394.68176arXiv1410.0245OpenAlexW1760158404MaRDI QIDQ1664122
Benjamin Fish, Ádám D. Lelkes, György Turán, Lev Reyzin, Jeremy Kun
Publication date: 24 August 2018
Full work available at URL: https://arxiv.org/abs/1410.0245
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Equivalence classes and conditional hardness in massively parallel computations ⋮ Component stability in low-space massively parallel computation ⋮ Transcriptomics: Quantifying Non-Uniform Read Distribution Using MapReduce ⋮ Security and privacy aspects in MapReduce on clouds: a survey
This page was built for publication: On the computational complexity of MapReduce
