An improved reliability bound of a probabilistic parallel integer sorting algorithm

DOI10.1016/j.ipl.2012.09.003zbMath1259.68257OpenAlexW2091940879MaRDI QIDQ1941705

Alexandros V. Gerbessiotis

Publication date: 21 March 2013

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

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

zbMATH Keywords

analysis of algorithmsparallel algorithmsrandomized algorithmsinteger sortinguniformly distributed integers

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• On parallel integer sorting
• Hybridsort revisited and parallelized
• Probabilistic integer sorting
• Parallel Merge Sort
• Finding the maximum, merging, and sorting in a parallel computation model
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: An improved reliability bound of a probabilistic parallel integer sorting algorithm