Adaptive sorting and the information theoretic lower bound

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 654-662

  Elmasry, Amr ^a   Fredman, Michael L ^b  

^a Alexandria University Faculty Of Science   (Egypt)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ADAPTIVE SORTING; INFORMATION-THEORETIC LOWER BOUNDS; INPUT SEQUENCE; NEAR-OPTIMAL; NUMBER OF INVERSIONS;

INFORMATION THEORY;

EID: 31844456436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_57     Document Type: Article

References (21)

1. A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In Proc. Scandinavian Workshop on Algorithm Theory, Springer Verlag (1990), 111-121.
2. M. Brown and R. Tarjan. Design and analysis of data structures for representing sorted lists. SIAM J. Comput. 9(1980), 594-614.
3. J. Bentley and A. Yao. An almost optimal algorithm for unbounded searching. Information Processing Letters 5(3) (1976), 82-87.
4. S. Carlsson, C. Levcopoulos and O. Petersson. Sublinear merging and natural Mergesort. Algorithmica 9 (1993), 629-648.
5. R. Cole. On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Comput. 30 (2000), 44-85.
6. A. Elmasry. Priority queues, pairing and adaptive sorting. 29th ICALP. In LNCS 2380 (2002), 183-194.
7. V. Estivill-Castro. A survey of adaptive sorting algorithms. ACM Comput. Surv. vol 24(4) (1992), 441-476.
8. V. Estivill-Castro and D. Wood. A new measure of presortedness. Infor. and Comput. 83 (1989), 111-119.
9. M. Fredman. How good is the information theory bound in sorting?. Theoretical Computer Science 1 (1976), 355-361.
10. L. Guibas, E. McCreight, M. Plass and J. Roberts. A new representation of linear lists. ACM Symp. on Theory of Computing 9 (1977), 49-60.
11. D. Knuth. The art of Computer programming. Vol III: Sorting and Searching. Addison-wesley, second edition (1998).
12. C. Levcopoulos and O. Petersson. Splitsort - An adaptive sorting algorithm. Information Processing Letters 39 (1991), 205-211.
13. C. Levcopoulos and O. Petersson. Adaptive Heapsort. J. of Algorithms 14 (1993), 395-413.
14. C. Levcopoulos and O. Petersson. Sorting shuffled monotone sequences. Inform. and Comput. 112 (1994), 37-50.
15. C. Levcopoulos and O. Petersson. Exploiting few inversions when sorting: Sequential and parallel algorithms. Theoretical Computer Science 163 (1996), 211-238.
16. H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput. C-34 (1985), 318-325.
17. K. Mehlhorn Data structures and algorithms. Vol.1. Sorting and Searching. Springer-Verlag, Berlin/Heidelberg. (1984)
18. K. Mehlhorn. Sorting presorted files. Proc. of the 4th GI Conference on Theory of Computer Science. LNCS 67 (1979), 199-212.
19. A. Moffat, O. Petersson and N. Wormald A tree-based Mergesort. Acta Informatica, Springer-Verlag (1998), 775-793.
20. O. Petersson and A. Moffat. A framework for adaptive sorting. Discrete App. Math. 59 (1995), 153-179.
21. D. Sleator and R. Tarjan. Self-adjusting binary search trees. J. ACM 32(3) (1985), 652-686.