Finding a pair on a mesh with multiple broadcasting is hard

DOI10.1007/BFB0002743MaRDI QIDQ4536938zbMATH OpenFDO

Authors Peter Damaschke

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002743

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Complexity of Sub-Bus Mesh Computations
• Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting
• Leftmost one computation on meshes with row broadcasting
• Selection on k-Dimensional Meshes with Multiple Broadcasting
• Solving cheap graph problems on Meshes

Cited in

(2)

• Complexity of Sub-Bus Mesh Computations
• Leftmost one computation on meshes with row broadcasting

This page was built for publication: Finding a pair on a mesh with multiple broadcasting is hard

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