Fast Stable Merging And Sorting In Constant Extra Space (1990)

Cached

Download Links

by Bing-chao Huang , Michael A. Langston
Citations:8 - 0 self

Documents Related by Co-Citation

18 Practical in-place merging – B-C Huang, M A Langston - 1988
13 Optimal stable merging – A Ntonios Symvonis - 1995
16 Simplified stable merging tasks – Jeffrey Salowe, William Steiger - 1987
7 A simple linear-time algorithm for – H Mannila, E Ukkonen - 1984
8 Practical in-place mergesort, Nordic – J Katajainen, T Pasanen, J Teuhola - 1996
5 Stable linear time sublinear space merging – S Dvorak, B Durian - 1987
10 Optimal ordering algorithm without operational eld – M A Kronrod - 1969
2190 The Art of Computer Programming – Donald Knuth - 1973
4 Towards an efficient merging – S Dvorak, B Durian - 1986
45 A simple algorithm for merging two disjoint linearly-ordered sets – F. K. Hwang, S. Lin - 1972
8 Stable sorting and merging with optimal space and time bounds – L T Pardo - 1977
8 A simple linear-time algorithm for in situ merging – H Mannila, E Ukkonen - 1984
5 Convex hulls of finite point sets in two and three dimensions – F P Preparata, S J Hong - 1977
3 Unstable linear time O(1) space merging – S Dvorak, B Durian - 1988
6 Stable in situ sorting and minimum data movement. BIT – J I Munro, V Raman, J S Salowe - 1990
5 Sorting a random access file in situ – H W Six, L Wegner - 1984
4 Intersection of convex objects in 2 and 3 dimensions – B Chazelle, D P Dobkin - 1987
12 Implicit selection – Tony W Lai, Derick Wood - 1988
4 Gasteren. An introduction to three algorithms for sorting – E W Dijkstra, A J M van - 1982