A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm

DOI10.1016/0196-6774(88)90024-7zbMath0651.68078OpenAlexW1977374486MaRDI QIDQ3796770

Alejandro A. Schäffer

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90024-7

zbMATH Keywords

parallel sortingfinite state machines

Mathematics Subject Classification ID

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

This page was built for publication: A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm