Average time behavior of distributive sorting algorithms

DOI10.1007/BF02243418zbMath0447.68066OpenAlexW10166594MaRDI QIDQ1146523

T. Klincsek, Luc P. Devroye

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243418

zbMATH Keywords

average complexityexpected running timeaverage time behaviorbucket sortingdistributive sorting algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (7)

A note on linear expected time algorithms for finding convex hulls ⋮ On the computer generation of random convex hulls ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Analysis of N-trees ⋮ The asymptotic behaviour of a distributive sorting method ⋮ On search by address computation ⋮ Sorting in linear expected time

Cites Work

• Distribution inequalities for the binomial law
• Sorting by distributive partitioning
• An efficient algorithm for determining the convex hull of a finite planar set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average time behavior of distributive sorting algorithms