Presorting algorithms: an average-case point of view
From MaRDI portal
Publication:1575533
DOI10.1016/S0304-3975(98)00181-9zbMath0944.68041WikidataQ126975332 ScholiaQ126975332MaRDI QIDQ1575533
Yeong-Nan Yeh, Hsien-Kuei Hwang, Bo-Yin Yang
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Asymptotic expansions of the mergesort recurrences
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Mellin transforms and asymptotics. The mergesort recurrence
- A framework for adaptive sorting
- Measures of Presortedness and Optimal Sorting Algorithms
- Sorting, trees, and measures of order
- Optimal sampling strategies for quicksort
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Presorting algorithms: an average-case point of view