Parallel sorting on Cayley graphs

DOI10.1007/BF01759059zbMath0729.68025OpenAlexW2023278070MaRDI QIDQ807014

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) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (3)

A ranking algorithm for Hamilton paths in shuffle-exchange graphs ⋮ Periodic comparator networks ⋮ New classes of interconnection topology structures and their properties

Cites Work

• Unnamed Item
• A new algorithm for generation of permutations
• Sorting in constant number of row and column phases on a mesh
• Ramanujan graphs
• Bounds for sorting by prefix reversal
• The periodic balanced sorting network
• A group-theoretic model for symmetric interconnection networks
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms

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