scientific article; zbMATH DE number 4035170
From MaRDI portal
Publication:3774969
Recommendations
Cited in
(30)- Lower bounds for sorting on mesh-connected architectures
- Sorting in constant number of row and column phases on a mesh
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- Optimal routing algorithms for mesh-connected processor arrays
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Packet Routing on grids of processors
- Multiplicative circulant networks. Topological properties and communication algorithms
- scientific article; zbMATH DE number 4155865 (Why is no real title available?)
- Systolic Sorting on a Mesh-Connected Network
- scientific article; zbMATH DE number 3958741 (Why is no real title available?)
- scientific article; zbMATH DE number 4031004 (Why is no real title available?)
- scientific article; zbMATH DE number 4049075 (Why is no real title available?)
- scientific article; zbMATH DE number 4054924 (Why is no real title available?)
- On multidimensional arrays of processors
- Systolic s/sup 2/-way merge sort is optimal
- Scalable algorithms for the mesh with buses: merging, sorting and selection
- Row-Major Sorting on Meshes
- Sorting on a Mesh-Connected Computer with Delaying Links
- A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
- scientific article; zbMATH DE number 1026282 (Why is no real title available?)
- Constant time sorting on reconfigurable meshes
- scientific article; zbMATH DE number 1760032 (Why is no real title available?)
- Optimal average case sorting on arrays
- k-k Sorting on the multi-mesh
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
- Integer sorting on a mesh-connected array of processors
- Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions
- A unified algorithm for sorting on multidimensional mesh-connected processors
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774969)
