Faster merging networks with a small constant period
From MaRDI portal
Publication:2629229
DOI10.1016/j.tcs.2016.05.038zbMath1345.68121OpenAlexW2409247320MaRDI QIDQ2629229
Publication date: 5 July 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.038
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Unnamed Item
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Periodic merging networks
- Periodic sorting using minimum delay, recursively constructed merging networks
- Periodic comparator networks
- Periodification scheme
- A Correction Network for N-Sorters
- A sequential sorting network analogous to the batcher merge
- The periodic balanced sorting network
- Cardinality Networks and Their Applications