scientific article; zbMATH DE number 1026282

MaRDI QIDQ4342907zbMATH OpenFDO

Authors Bogdan S. Chlebus

Publication date 24 June 1997

zbMATH Keywords

matching lower boundsmesh-connected processor arrays

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed algorithms (68W15)

Recommendations

• Upper and lower bounds for selection on the mesh
• Selection on k-Dimensional Meshes with Multiple Broadcasting
• scientific article; zbMATH DE number 4035170
• Row-Major Sorting on Meshes
• Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
• Optimal Coarsening of Unstructured Meshes
• scientific article; zbMATH DE number 4155810
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• An optimized algorithm of mesh parameterization

Cited in

(11)

• A generalization of the 0-1 principle for sorting
• Upper and lower bounds for selection on the mesh
• The calculation of average distance in mesh structures.
• Fast deterministic selection on mesh-connected processor arrays
• On the Average Running Time of Odd–Even Merge Sort
• scientific article; zbMATH DE number 4155865 (Why is no real title available?)
• Scalable algorithms for the mesh with buses: merging, sorting and selection
• Sorting on a Mesh-Connected Computer with Delaying Links
• scientific article; zbMATH DE number 1760032 (Why is no real title available?)
• Optimal average case sorting on arrays
• Beyond the worst-case bisection bound: Fast sorting and ranking on meshes

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 Q4342907)