Author:
Katajainen Jyrki,Pasanen Tomi,Titan George
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Dudziński K., Dydek A., “On stable minimum storage merging algorithm”, Information Processing Letters 12 (1981) 5–8
2. Dvořák S., Ďurian B., “Towards an efficient merging”, Proc. of the 12th Symposium on Mathematical Foundations of Computer Science (1986) 290–298
3. Huang B-C., Langston M. A., “Practical in-place merging”, Communications of the ACM 31 (1988) 348–352
4. Huang B-C., Langston M. A., “Fast stable merging and sorting in constant extra space”, Proc. of the 1st International Conference on Computing and Information (1989) 71–79
5. Hwang F. K., Lin S., “A simple algorithm for merging two disjoint linearly ordered sets”, SIAM Journal on Computing 1 (1972) 31–39