Parallel sorting on Cayley graphs

DOI10.1007/BF01759059MaRDI QIDQ807014zbMATH OpenOpenAlexFDO

Authors Daniel M. Gordon

Publication date 1991

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01759059

zbMATH Keywords

sortingsorting network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1990688
• Parallel sorting revisited
• Cubesort: A parallel algorithm for sorting N data items with S-sorters
• scientific article; zbMATH DE number 4064478
• scientific article; zbMATH DE number 4074508

Cites work

• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A group-theoretic model for symmetric interconnection networks
• A new algorithm for generation of permutations
• Bounds for sorting by prefix reversal
• Ramanujan graphs
• Sorting in constant number of row and column phases on a mesh
• The periodic balanced sorting network

Cited in

(9)

• Parallel ordering using edge contraction
• scientific article; zbMATH DE number 1990688 (Why is no real title available?)
• Periodic comparator networks
• scientific article; zbMATH DE number 5533281 (Why is no real title available?)
• Sorting networks on restricted topologies
• Sorting on OTIS-Networks
• New classes of interconnection topology structures and their properties
• A ranking algorithm for Hamilton paths in shuffle-exchange graphs
• scientific article; zbMATH DE number 828043 (Why is no real title available?)

This page was built for publication: Parallel sorting on Cayley graphs

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