Associative Reductions
Associative Reductions is a reduction operation that belongs to the class of parallel computation methods, distinguished by its reliance on associative binary operations to combine elements in a data sequence such that the grouping of operations does not affect the final result.
10
Publications
191
Citations
27
Authors
12
Institutions
Publications per year
2017–2026
1
Parents
10
Gautam, Sanjay Rajopadhye · 2006 · 30 citations
Full disjunctions: polynomial-delay iterators in action
Sara Cohen, Itzhak Fadida, Yaron Kanza et al. · 2006 · 29 citations
Stability theorems for Lie algebras of derivations
Charles B. Hallahan · Pacific Journal of Mathematics · 1970 · 27 citations · Full text
Polly's Polyhedral Scheduling in the Presence of Reductions
Johannes Doerfert, Kevin Streit, Sebastian Hack et al. · arXiv (Cornell University) · 2015 · 15 citations · Full text
1–5 of 10
27
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 27
12
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
2 publications
58 citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
1 h-index
1 publications
30 citations
Colorado State University
Fort Collins, United States
1 h-index
2 publications
60 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
29 citations
Chalmers University of Technology
Gothenburg, Sweden
1 h-index
1 publications
12 citations

University of Twente
Enschede, The Netherlands
1 h-index
4 publications
56 citations
Charles University
Prague, Czechia
1 h-index
2 publications
24 citations
Google (United States)
Mountain View, United States
1 h-index
2 publications
28 citations
1–8 of 12
1 publications · 15 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 12 citations
1
h-index
Conference · 1 publications · 14 citations
1
h-index
1 publications · 27 citations
1
h-index
1–5