An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract)

Authors:
L. Hyafil;F. Prusker;J. Vuillemin
Affiliations:
-;-;-
Venue:
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Year:
1974

Citing 2
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

Shifting Graphs and Their Applications

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm which computes the optimal pattern for merging n equal size sorted sequences stored on a disk, in time O(log n) and constant space. The best previously known algorithm for solving this problem (Knuth [4], Schlumberger-Vuillemin [5]) takes time O(n2) and space O(n).