Sorting on a mesh-connected parallel computer

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (51)

CryptAttackTester: high-assurance attack analysis
Simulating the Bitonic Sort Using P Systems
TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING
Integer sorting on a mesh-connected array of processors
Packet Routing on grids of processors
Discrete configuration spaces of squares and hexagons
Sorting in constant number of row and column phases on a mesh
Optimal routing algorithms for mesh-connected processor arrays
SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗
Computing Hough transforms on hypercube multicomputers
Dynamic computational geometry on meshes and hypercubes
A VLSI partition algorithm
Geometric problems on two-dimensional array processors
Solving visibility and separability problems on a mesh-of-processors
Time lower bounds for parallel sorting on a mesh-connected processor array
Flit-serial packet routing on meshes and tori
Indexing functions and time lower bounds for sorting on a mesh-connected computer
The balanced binary tree technique on mesh-connected computers
A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
Fast deterministic selection on mesh-connected processor arrays
AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
Computational geometry algorithms for the systolic screen
Sloping-and-shaking
A unified \(O(\log N)\) and optimal sorting vector algorithm
Solving visibility problems on MCCs of smaller size
Randomized multipacket routing and sorting on meshes
Parallel geometric algorithms on a mesh-connected computer
Space and time complexities of balanced sorting on processor arrays
A neural sorting network with O(1) time complexity
A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
A constant-time parallel algorithm for computing convex hulls
A generalization of the zero-one principle for sorting algorithms
A unified algorithm for sorting on multidimensional mesh-connected processors
An elegant algorithm for the construction of suffix arrays
Computing convexity properties of images on a pyramid computer
Branch-and-bound and backtrack search on mesh-connected arrays of processors
Swapping labeled tokens on graphs
Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
Parallel general prefix computations with geometric, algebraic, and other applications
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
Efficient algorithms for parallel sorting on mesh multicomputers
A new parallel sorting algorithm based upon min-mid-max operations
k-fold bitonic sort on a mesh-connected parallel computer
Robust algorithms for packet routing in a mesh
Scalable algorithms for the mesh with buses: merging, sorting and selection
A VLSI algorithm for sorting variable-length character strings
VLSI-sorting evaluated under the linear model
An efficient selection algorithm on the pyramid
A parallel sorting scheme whose basic operation sortsN elements

This page was built for publication: Sorting on a mesh-connected parallel computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120129)