TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING

DOI10.1080/10637199608915557zbMATH Open1049.68931OpenAlexW2006314341MaRDI QIDQ4820157FDOQ4820157

Authors: Ion Lucretiu Stoica 

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199608915557

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer
• Parallel general prefix computations with geometric, algebraic, and other applications

Cited In (1)

• Sorting signed permutations by reversals, revisited

This page was built for publication: TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING

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