Author:
Estivill-Castro Vladimir,Wood Derick
Reference20 articles.
1. C. Aragon and R. Seidel. Randomized search trees. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 540–545, Research Triangle Park, NC, 1989.
2. CR. Cook and D.J. Kim. Best sorting algorithms for nearly sorted lists. Communications of the ACM, 23:620–624, 1980.
3. E.W. Dijkstra. Smoothsort, an alternative to sorting in situ. Science of Computer Programming, 1:223–233, 1982.
4. P.G. Dromey. Exploiting partial order with Quicksort. Software — Practice and Experience, 14(6):509–518, 1984.
5. V. Estivill-Castro. Sorting and Measures of Disorder. PhD thesis, University of Waterloo, 1991. Available as Department of Computer Science Research Report CS-91-07.