Complexity Results for Permuting Data and Other Computations on Parallel Processors

DOI10.1145/62.322423MaRDI QIDQ3768404zbMATH OpenOpenAlexFDO

Authors Allan Gottlieb, Clyde Kruskal

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/62.322423

zbMATH Keywords

lower boundsparallel computationpermutationsroutingshuffle- exchange machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• PRAM's towards realistic parallelism: BRAM's
• A complexity theory of efficient parallel algorithms

This page was built for publication: Complexity Results for Permuting Data and Other Computations on Parallel Processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768404)