Priority queues, pairing, and adaptive sorting

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

Volumn 2380 LNCS, Issue , 2002, Pages 183-194

  Elmasry, Amr ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADAPTIVE SORTING; ADAPTIVE SORTING ALGORITHMS; INPUT SEQUENCE; NUMBER OF INVERSIONS; PRIORITY QUEUES; SIMPLE STRUCTURES;

AUTOMATA THEORY;

EID: 84869174075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_17     Document Type: Conference Paper

References (16)

1. M. Brown. Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7 (1978), 298-319.
2. M. Brown and R. Tarjan. Design and analysis of data structures for representing sorted lists. SIAM J. Comput. 9 (1980), 594-614.
3. R. Cole. On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Comput. 30 (2000), 44-85.
4. V. Estivill-Castro. A survey of adaptive sorting algorithms. ACM Comput. Surv. vol 24(4) (1992), 441-476.
5. L. Guibas, E. McCreight, M. Plass and J. Roberts. A newr epresentation of linear lists. ACM Symp. on Theory of Computing 9 (1977), 49-60.
6. D. Knuth. The Art of Computer Programming. Vol III: Sorting and Searching. Addison-wesley, second edition (1998).
7. C. Levcopoulos and O. Petersson. Splitsort - An adaptive sorting algorithm. Information Processing Letters 39 (1991), 205-211.
8. C. Levcopoulos and O. Petersson. Adaptive Heapsort. J. of Alg. 14 (1993), 395-413.
9. C. Levcopoulos and O. Petersson. Exploiting fewinversions when sorting: Sequential and parallel algorithms. Theoretical Computer Science 163 (1996), 211-238.
10. H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput. C-34 (1985), 318-325.
11. K. Mehlhorn. Sorting presorted files. Proc. Of the 4th GI Conference on Theory of Computer Science. LNCS 67 (1979), 199-212.
12. K. Mehlhorn Data Structures and Algorithms. Vol. 1. Sorting and Searching. Springer-Verlag, Berlin/Heidelberg. (1984).
13. A. Moffat, G. Eddy and O. Petersson. Splaysort: fast, verstile, practical. Softw. Pract. and Exper. Vol 126(7) (1996), 781-797.
14. A. Moffat, O. Petersson and N. WormaldA tree-based Mergesort. Acta Informatica, Springer-Verlag (1998), 775-793.
15. D. Sleator and R. Tarjan. Self-adjusting binary search trees. J. ACM 32(3) (1985), 652-686.
16. J. Vuillemin. A data structure for manipulating priority queues. Comm. ACM 21(4) (1978), 309-314.