Prefix graphs and their applications

DOI10.1007/3-540-59071-4_49zbMath1528.68279OpenAlexW1525974034MaRDI QIDQ6184370

Torben Hagerup, Shiva P. Chaudhuri

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59071-4_49

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• On parallel integer merging
• Unbounded fan-in circuits and associative functions
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized range-maxima in nearly-constant parallel time
• Parallel Prefix Computation
• Recursive Star-Tree Parallel Data Structure
• Parallelism in Comparison Problems
• Parallel linear programming in fixed dimension almost surely in constant time
• The Parallel Simplicity of Compaction and Chaining
• The log-star revolution

This page was built for publication: Prefix graphs and their applications