Sorting in constant number of row and column phases on a mesh
From MaRDI portal
Publication:1105380
DOI10.1007/BF01762132zbMATH Open0648.68072OpenAlexW2081789047MaRDI QIDQ1105380FDOQ1105380
Authors: John M. Marberg, Eli Gafni 
Publication date: 1988
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01762132
Recommendations
Cites Work
- Title not available (Why is that?)
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Sorting on a mesh-connected parallel computer
- Tight Bounds on the Complexity of Parallel Sorting
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- Title not available (Why is that?)
- Systolic Sorting on a Mesh-Connected Network
Cited In (9)
- 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
- Self-simulation for the Passive Optical Star model
- 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
- Constant time sorting on reconfigurable meshes
- Parallel sorting on Cayley graphs
- Parallel interval order recognition and construction of interval representations
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
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)
