On the optimality of tape merge of two lists with similar size
From MaRDI portal
Publication:2182103
DOI10.1007/s00453-020-00690-xzbMath1442.68044OpenAlexW3008886243MaRDI QIDQ2182103
Qian Li, Xiaoming Sun, Jia-Lin Zhang
Publication date: 21 May 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6821/
Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Merging of 4 or 5 elements with n elements
- An improvement of the binary merge algorithm
- Average-case analysis of the merging algorithm of Hwang and Lin
- Searching monotone multi-dimensional arrays
- Optimal merging of 2 elements with n elements
- On Generalized Comparison-Based Sorting Problems
- The Information-Theoretic Bound is Good for Merging
- Sorting and Selection with Imprecise Comparisons
- Searching ordered structures
- Optimal expected-time algorithms for merging
- Minimum comparison merging of sets of approximately equal size
- On the Optimality of Linear Merge
- Optimal Merging of 3 Elements with n Elements
- Two Probabilistic Results on Merging
- Merging with parallel processors
- Minimean Merging and Sorting: An Algorithm
- A Fast Merging Algorithm
- Significant Improvements to the Hwang-Lin Merging Algorithm
- Algorithms for the Generalized Sorting Problem
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
- A Class of Merging Algorithms
This page was built for publication: On the optimality of tape merge of two lists with similar size
