Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
From MaRDI portal
Publication:915448
Recommendations
- Time lower bounds for parallel sorting on a mesh-connected processor array
- scientific article; zbMATH DE number 3958741
- Lower bounds for sorting on mesh-connected architectures
- scientific article; zbMATH DE number 4035170
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
Cites work
- scientific article; zbMATH DE number 3871363 (Why is no real title available?)
- scientific article; zbMATH DE number 4035170 (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
Cited in
(7)- Lower bounds for sorting on mesh-connected architectures
- 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
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Space and time complexities of balanced sorting on processor arrays
- scientific article; zbMATH DE number 3958741 (Why is no real title available?)
- scientific article; zbMATH DE number 4049075 (Why is no real title available?)
This page was built for publication: Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915448)