Parallel dynamic lowest common ancestors

DOI10.1007/3-540-58218-5_28zbMath1502.68103OpenAlexW1487747961MaRDI QIDQ5054770

Eric Schenk

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_28

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Algorithms for Finding Nearest Common Ancestors
• Derivation of a parallel algorithm for balancing binary trees
• An Efficient Method for Storing Ancestor Information in Trees
• Parallel Algorithms in Graph Theory: Planarity Testing
• Recursive Star-Tree Parallel Data Structure
• On Finding Lowest Common Ancestors in Trees

This page was built for publication: Parallel dynamic lowest common ancestors