Multiway Merging
Multiway Merging is a divide-and-conquer algorithmic technique that extends the merging step of sorting algorithms by simultaneously combining more than two sorted sequences into a single sorted output, distinguished from binary merging by its ability to integrate multiple ordered inputs in a single pass.
25
Publications
1K
Citations
70
Authors
32
Institutions
Publications per year
2017–2026
3
Variants
Multi-way Merging
Parents
25
Automated Vehicle Merging Maneuver Implementation for AHS
Xiao‐Yun Lu, Han-Shue Tan, Steven E Shladover et al. · Vehicle System Dynamics · 2004 · 109 citations
A three-way merge for XML documents
Tancred Lindholm · 2004 · 89 citations
1–5 of 25
70
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 70
32
Karlsruhe Institute of Technology
Karlsruhe, Germany
2 h-index
7 publications
249 citations
Texas A&M University
College Station, United States
2 h-index
4 publications
118 citations
IBM Research - Austin
Austin, United States
2 h-index
2 publications
59 citations
Kent State University
Kent, United States
1 h-index
1 publications
42 citations
University of Washington
Seattle, United States
1 h-index
2 publications
48 citations
Isfahan University of Technology
Isfahan, Iran
1 h-index
1 publications
10 citations

University of York
York, United Kingdom
1 h-index
1 publications
42 citations
Institute of Computer Science
Warsaw, Poland
1 h-index
2 publications
32 citations
1–8 of 32
PVLDB · 2 publications · 276 citations
2
h-index
TPDS · 2 publications · 56 citations
2
h-index
TRR · 1 publications · 15 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 39 citations
1
h-index
1–5