Presorting algorithms: an average-case point of view
type: Item
instance of: scholarly article
title: Presorting algorithms: an average-case point of view
zbMATH Open document ID: 0944.68041
DOI: 10.1016/S0304-3975(98)00181-9
author: Hsien-Kuei Hwang
author: Bo-Yin Yang
author: Yeong-Nan Yeh
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1493349
zbMATH Keywords: presorting
zbMATH Keywords: measure of presortedness
MaRDI profile type: Publication
cites work: Sorting, trees, and measures of order
cites work: Q4153936
cites work: Mellin transforms and asymptotics. The mergesort recurrence
cites work: Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
cites work: Q3939231
cites work: Asymptotic expansions of the mergesort recurrences
cites work: Q4057549
cites work: Optimal sampling strategies for quicksort
cites work: Measures of Presortedness and Optimal Sorting Algorithms
cites work: Q4178501
cites work: A framework for adaptive sorting
cites work: Q4385514
Wikidata QID: Q126975332
description: scientific article; zbMATH DE number 1493349