Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
type: Item
instance of: scholarly article
title: Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
zbMATH Open document ID: 0854.62052
DOI: 10.1016/0167-7152(95)00139-5
author: Janice Lent
author: Hosam M. Mahmoud
published in: Statistics \& Probability Letters
publication date: 1997-01-16T00:00:00Z
Mathematics Subject Classification ID: 62G30
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 65C99
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 926957
zbMATH Keywords: Quickselect
zbMATH Keywords: Quicksort
zbMATH Keywords: sorting
zbMATH Keywords: selection of order statistics
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: random binary search tree
describes a project that uses: Quicksort
describes a project that uses: Algorithm 489
MaRDI profile type: Publication
full work available at URL: 0167-7152(95)00139-5
OpenAlex ID: W2026693728
cites work: Randomized binary search technique
cites work: Limit laws for local counters in random binary search trees
cites work: How Many Comparisons Does Quicksort Use?
cites work: Small Sample Behavior of Some Robust Linear Estimators of Location
cites work: Sequential Confidence Intervals Based on Rank Tests
cites work: Combinatorial analysis of quicksort algorithm
cites work: Quicksort
cites work: Q3706485
cites work: Q4004056
cites work: Analysis of quickselect : an algorithm for order statistics
cites work: A limiting distribution for quicksort
cites work: A limit theorem for “quicksort”
cites work: Approximation Theorems of Mathematical Statistics
cites work: Some properties of a limiting distribution in Quicksort
cites work: Q5561562
description: scientific article; zbMATH DE number 926957