Optimal incremental sorting

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 171-182

  Paredes, Rodrigo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SORTING;

KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM; ONLINE ALGORITHM; OPTIMAL TIME; SORTED SEQUENCE;

DATABASE SYSTEMS;

EID: 33646827195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.16     Document Type: Conference Paper

References (26)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
2. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
3. J. M. Chambers. Algorithm 410 (PARTIAL SORTING). Communications of the ACM, 14(5):357-358, 1971.
4. B. Chazelle. A minimum spanning tree algorithm with inverse-ackermann type complexity. Journal of the ACM, 47(6):1028-1047, 2000.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.
6. R. W. Floyd. Algorithm 245 (TREESORT). Communications of the ACM, 7:701, 1964.
7. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: a new form of self-adjusting heap. Algorithmica, 1(1):111-129, 1986.
8. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987.
9. G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 2nd edition, 1991.
10. C. A. R. Hoare. Algorithm 65 (FIND). Communications of the ACM, 4(7):321-322, 1961.
11. C. A. R. Hoare. Quicksort. Computer Journal, 5(1):10-15, 1962.
12. S. Janson, D. Knuth, T. Luczak, and B. Pittel. The birth of the giant component. Random Structures & Algorithms, 4(3):233-358, 1993.
13. D. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. ACM, 42(2):321-328, 1995.
14. I. Katriel, P. Sanders, and J. Träff. A practical minimum spanning tree algorithm using the cycle property. Research Report MPI-I-2002-1-003, Max-Planck-Institut für Informatik, October 2002.
15. I. Katriel, P. Sanders, and J. Träff. A practical minimum spanning tree algorithm using the cycle property. In 11th European Symposium on Algorithms (ESA '09), LNCS 2832, pages 679-690, 2003.
16. J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.
17. C. Martínez. Partial quicksort. In Proc. 6th ACM-SIAM Workshop on Algorithm Engineering and Experiments and 1st ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics, pages 224-228, 2004.
18. B. Moret and H. Shapiro. An empirical analysis of algorithms for constructing a minimum spanning tree.In Proc. 2nd Workshop Algorithms and Data Structures (WADS'91), LNCS 519, pages 400-411, 1991.
19. S. Pettie and V. Ramachandran. An optimal minimum spanning tree algorithm. Journal of the ACM, 49(1):16-34, 2002.
20. R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
21. R Development Core Team. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria, 2004.
22. P. Sanders. Fast priority queues for cached memory. J. Exp. Algorithmics, 5:7, 2000.
23. R. E. Tarjan. Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1983.
24. I. Wegener. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small). Theoretical Computer Science, 118(1):81-98, 1993.
25. M. Weiss. Data structures & algorithm analysis in Java™. Addison-Wesley, 1999.
26. J. Williams. Algorithm 232 (HEAPSORT). Communications of the ACM, 7(6):347-348, 1964.