Simple parallel algorithms for dynamic range products

DOI10.1007/978-3-319-24024-4_23zbMATH Open1331.68284OpenAlexW2403097123MaRDI QIDQ3464484FDOQ3464484

Authors: Christos 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

Recommendations

• Parallel preprocessing for path queries without concurrent reading.
• Parallel dynamic lowest common ancestors
• scientific article; zbMATH DE number 753968
• scientific article; zbMATH DE number 4064469
• Randomized range-maxima in nearly-constant parallel time

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Title not available (Why is that?)
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Shortest paths in digraphs of small treewidth. I: Sequential algorithms
• Computing on a free tree via complexity-preserving mappings
• Title not available (Why is that?)
• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
• Parallel preprocessing for path queries without concurrent reading.

This page was built for publication: Simple parallel algorithms for dynamic range products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464484)