Scan Algorithm
A Scan Algorithm is a parallel computation method that belongs to the class of prefix computation techniques, distinguished by its systematic aggregation of an input sequence through an associative binary operation to produce a sequence of partial results, where each output element represents the cumulative effect of all preceding inputs up to that point.
387
Publications
25.8K
Citations
1.2K
Authors
465
Institutions
Publications per year
2017–2026
67
Variants
Parallel Prefix Algorithm
Parents
387
Tian Zhang, Raghu Ramakrishnan, Miron Livny · 1996 · 3.9K citations
Tian Zhang, Raghu Ramakrishnan, Miron Livny · ACM SIGMOD Record · 1996 · 2.1K citations · Full text
Real-time correlative scan matching
Edwin Olson · 2009 · 358 citations
1–5 of 387
1.2K
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 1.2K
465
University of Wisconsin–Madison
Madison, United States
9 h-index
24 publications
19.3K citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
20 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
8 publications
601 citations
Stanford University
Stanford, United States
6 h-index
8 publications
684 citations

University of Waterloo
Waterloo, Canada
6 h-index
14 publications
491 citations
University of Stuttgart
Stuttgart, Germany
5 h-index
15 publications
513 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
12 publications
270 citations

University of Toronto
Toronto, Canada
5 h-index
7 publications
281 citations
1–8 of 465
9 publications · 253 citations
9
h-index
5 publications · 63 citations
5
h-index
4 publications · 167 citations
4
h-index
4 publications · 333 citations
4
h-index
4 publications · 121 citations
4
h-index
1–5