Parallel Merging
Parallel Merging is a parallel algorithmic technique that belongs to the class of merging methods, distinguished by its simultaneous coordination of multiple processing units to combine two or more sorted sequences into a single sorted sequence in reduced time complexity.
55
Publications
5.5K
Citations
128
Authors
63
Institutions
Publications per year
2017–2026
9
Parents
55
Towards Internet-scale multi-view stereo
Yasutaka Furukawa, Brian Curless, Steven M. Seitz et al. · 2010 · 759 citations
Richard Cole · SIAM Journal on Computing · 1988 · 734 citations
Hung‐Chih Yang, Ali Dasdan, Ruey-Lung Hsiao et al. · 2007 · 717 citations
Parallelism in Comparison Problems
Leslie G. Valiant · SIAM Journal on Computing · 1975 · 401 citations
Richard Cole · 1986 · 363 citations
1–5 of 55
128
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 128
63
Duke University
Durham, United States
3 h-index
16 publications
2.7K citations

Rice University
Houston, United States
3 h-index
5 publications
185 citations

Cornell University
Ithaca, United States
3 h-index
4 publications
210 citations

University of Manchester
Manchester, United Kingdom
2 h-index
6 publications
266 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
28 citations
University of Washington
Seattle, United States
2 h-index
3 publications
1.9K citations
University of Maryland, College Park
College Park, United States
2 h-index
6 publications
160 citations
New York University
New York, United States
2 h-index
2 publications
1.1K citations
1–8 of 63
3 publications · 132 citations
3
h-index
3 publications · 217 citations
3
h-index
2 publications · 121 citations
2
h-index
2 publications · 1.1K citations
2
h-index
TPDS · 2 publications · 53 citations
2
h-index
1–5