Indexing functions and time lower bounds for sorting on a mesh-connected computer
From MaRDI portal
(Redirected from Publication:1192947)
Recommendations
- Time lower bounds for parallel sorting on a mesh-connected processor array
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
- scientific article; zbMATH DE number 3958741
- Lower bounds for sorting on mesh-connected architectures
- scientific article; zbMATH DE number 4035170
Cites work
- Bitonic Sort on a Mesh-Connected Parallel Computer
- scientific article; zbMATH DE number 4035170 (Why is no real title available?)
- scientific article; zbMATH DE number 4049075 (Why is no real title available?)
- Lower bounds for sorting on mesh-connected architectures
- Sorting on a mesh-connected parallel computer
- Systolic Sorting on a Mesh-Connected Network
- Time lower bounds for parallel sorting on a mesh-connected processor array
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
Cited in
(5)- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- Time lower bounds for parallel sorting on a mesh-connected processor array
- Optimal routing algorithms for mesh-connected processor arrays
- Simulating the Bitonic Sort Using P Systems
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
This page was built for publication: Indexing functions and time lower bounds for sorting on a mesh-connected computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192947)