Distributed Reduction Algorithms
Distributed Reduction Algorithms is a computational method that systematically aggregates data values across multiple processing nodes in a parallel computing environment, distinguished by its orchestration of localized reductions followed by global consolidation to produce a final collective result.
52
Publications
2.6K
Citations
150
Authors
76
Institutions
Publications per year
2017–2026
16
Parents
52
Silvio Lattanzi, Benjamin Moseley, Siddharth Suri et al. · 2011 · 234 citations
MRPR: A MapReduce solution for prototype reduction in big data classification
Isaac Triguero, Daniel Peralta, Jaume Bacardit et al. · Neurocomputing · 2014 · 222 citations · Full text
1–5 of 52
150
2
h-index
University of Southern California, United States
2 publications · 503 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 150
76
Google (United States)
Mountain View, United States
2 h-index
2 publications
288 citations
IBM (United States)
Armonk, United States
2 h-index
5 publications
522 citations
University of Southern California
Los Angeles, United States
2 h-index
6 publications
1.5K citations

Universidad de Granada
Granada, Spain
2 h-index
5 publications
712 citations
ETH Zurich
Zurich, Switzerland
2 h-index
2 publications
84 citations

Peking University
Beijing, China
2 h-index
9 publications
397 citations
University of Michigan
Ann Arbor, United States
2 h-index
2 publications
72 citations

Nantong University
Nantong, China
2 h-index
6 publications
204 citations
1–8 of 76
Repository · 4 publications · 358 citations
4
h-index
ENTCS · 2 publications · 43 citations
2
h-index
FGCS · 2 publications · 28 citations
2
h-index
2 publications · 266 citations
2
h-index
2 publications · 100 citations
2
h-index
1–5