Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses
From MaRDI portal
Publication:1345655
DOI10.1006/jpdc.1994.1117zbMath0939.68606OpenAlexW2100482979MaRDI QIDQ1345655
Madhusudan Nigam, Sartaj K. Sahni
Publication date: 4 July 2000
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1994.1117
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical problems of computer architecture (68M07)
Related Items (4)
Reconfigurable meshes and image processing ⋮ COMPUTATION OF THE CONVEX HULL FOR SORTED POINTS ON A RECONFIGURABLE MESH ⋮ Integer summing algorithms on reconfigurable meshes ⋮ DESIGNING FAULT TOLERANT ALGORITHMS FOR RECONFIGURABLE MESHES
This page was built for publication: Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses