Probabilistic integer sorting

DOI10.1016/j.ipl.2004.02.007zbMath1177.68061OpenAlexW2079181012MaRDI QIDQ2390249

Alexandros V. Gerbessiotis, Constantinos J. Siniolakis

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.02.007

zbMATH Keywords

analysis of algorithmsinteger sortingsorting uniform keys

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (1)

An improved reliability bound of a probabilistic parallel integer sorting algorithm

Cites Work

• Unnamed Item
• On parallel integer sorting
• Hybridsort revisited and parallelized
• The design and analysis of a new hybrid sorting algorithm
• Parallel iterated bucket sort
• Parallel Merge Sort
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Internal Sorting by Radix Plus Sifting
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Probabilistic integer sorting