Nardelli, E. & Proietti, G. (2006),
'Efficient unbalanced merge-sort.', Inf. Sci.
176
(10)
, 1321-1337
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Baeza-Yates, R. A. (2004),
A Fast Set Intersection Algorithm for Sorted Sequences., in
Suleyman Cenk Sahinalp; S. Muthukrishnan & Ugur Dogrusoz, ed.,
'Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004'
, pp. 400-408
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Stumme, G. & Maedche, A. (2001),
FCA--Merge: Bottom-Up Merging of Ontologies, in
'IJCAI-2001 -- Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, USA, August, 1-6, 2001'
, Morgen Kaufmann, San Francisco
, pp. 225--234
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Cole, R. (1988),
'Parallel Merge Sort.', SIAM J. Comput.
17
(4)
, 770-785
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Bron, C. (1974),
'Merge Sort Algorithm (Remark on Algorithm 426).', Commun. ACM
17
(12)
, 706
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Bron, C. (1972),
'Merge Sort Algorithm [M1] (Algorithm 426).', Commun. ACM
15
(5)
, 357-358
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]