Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses

DOI10.1016/0020-0190(91)90082-SzbMath0742.68026OpenAlexW2023588769WikidataQ127498852 ScholiaQ127498852MaRDI QIDQ1183475

Rong Lin

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90082-s

zbMATH Keywords

treelist rankinglowest common ancestorsreconfigurable buses

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes

Cites Work

• Unnamed Item
• Unnamed Item
• Constant time sorting on a processor array with a reconfigurable bus system
• Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding Lowest Common Ancestors in Parallel
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Parallel Algorithms in Graph Theory: Planarity Testing

This page was built for publication: Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses