Sorting in constant number of row and column phases on a mesh
From MaRDI portal
Publication:1105380
Recommendations
Cites work
- scientific article; zbMATH DE number 4035170 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Sorting on a mesh-connected parallel computer
- Systolic Sorting on a Mesh-Connected Network
- Tight Bounds on the Complexity of Parallel Sorting
Cited in
(9)- Self-simulation for the Passive Optical Star model
- Constant time sorting on reconfigurable meshes
- Parallel interval order recognition and construction of interval representations
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Parallel sorting on Cayley graphs
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH
This page was built for publication: Sorting in constant number of row and column phases on a mesh
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105380)
