Periodic sorting using minimum delay, recursively constructed merging networks

zbMath0884.68041MaRDI QIDQ1379127

Edward A. Bender, S. Gill Williamson

Publication date: 18 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119227

zbMATH Keywords

merging network

Mathematics Subject Classification ID

Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (2)

Faster merging networks with a small constant period ⋮ Optimal conclusive sets for comparator networks

This page was built for publication: Periodic sorting using minimum delay, recursively constructed merging networks