Simple Parallel Algorithms for Dynamic Range Products

DOI10.1007/978-3-319-24024-4_23zbMath1331.68284OpenAlexW2403097123MaRDI QIDQ3464484

Christos D. Zaroliagis

Publication date: 27 January 2016

Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_23

Mathematics Subject Classification ID

Database theory (68P15) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing on a free tree via complexity-preserving mappings
• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
• Shortest paths in digraphs of small treewidth. I: Sequential algorithms
• Parallel preprocessing for path queries without concurrent reading.
• On Finding Lowest Common Ancestors: Simplification and Parallelization

This page was built for publication: Simple Parallel Algorithms for Dynamic Range Products