PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS

DOI10.1142/S0129054199000277zbMath1319.68247OpenAlexW2029882434MaRDI QIDQ5249012

H. Mongelli, Siang W. Song

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054199000277

zbMATH Keywords

parallel algorithmslowest common ancestorcoarse grainded multicomputerrange minima

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A unifying look at data structures
• Efficient pattern matching with scaling
• Recursive Star-Tree Parallel Data Structure
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS