Parallel sorting on Cayley graphs

DOI10.1007/BF01759059zbMATH Open0729.68025OpenAlexW2023278070MaRDI QIDQ807014FDOQ807014

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

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

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)

Cites Work

• A group-theoretic model for symmetric interconnection networks
• Ramanujan graphs
• Title not available (Why is that?)
• Bounds for sorting by prefix reversal
• A new algorithm for generation of permutations
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Periodic comparator networks
• 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
• Title not available (Why is that?)

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)