Time lower bounds for parallel sorting on a mesh-connected processor array

DOI10.1007/BF00288975zbMath0659.68087OpenAlexW1985905751MaRDI QIDQ1112618

Yijie Han, Yoshihide Igarashi

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

sortingparallel algorithmindexing schemeschain argumentmesh-connected processor arraytime lower bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

Indexing functions and time lower bounds for sorting on a mesh-connected computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for sorting on mesh-connected architectures
• Indexing functions and time lower bounds for sorting on a mesh-connected computer
• The VLSI Complexity of Sorting
• Tight Bounds on the Complexity of Parallel Sorting
• Systolic Sorting on a Mesh-Connected Network
• Sorting in Average Time $o(\log \,n)$
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer

This page was built for publication: Time lower bounds for parallel sorting on a mesh-connected processor array