Parallel preprocessing for path queries without concurrent reading.

DOI10.1006/INCO.1999.2814zbMath1046.68979OpenAlexW1981463937MaRDI QIDQ1854339

Torben Hagerup

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2814

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (2)

Succinct representations of weighted trees supporting path queries ⋮ Simple Parallel Algorithms for Dynamic Range Products

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Computing on a free tree via complexity-preserving mappings
• Dynamic algorithms for graphs of bounded treewidth
• Parallel Shortcutting of Rooted Trees
• Fast Algorithms for Finding Nearest Common Ancestors
• An Efficient Parallel Biconnectivity Algorithm
• Parallel Merge Sort
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Recursive Star-Tree Parallel Data Structure
• Efficiency of a Good But Not Linear Set Union Algorithm
• A simple parallel tree contraction algorithm

This page was built for publication: Parallel preprocessing for path queries without concurrent reading.