The log-star revolution

DOI10.1007/3-540-55210-3_189zbMath1493.68145OpenAlexW1554293633MaRDI QIDQ5096787

Torben Hagerup

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_189

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items

Tight bounds for parallel randomized load balancing ⋮ Efficient parallel computing with memory faults ⋮ The complexity of parallel prefix problems on small domains ⋮ A perfect parallel dictionary ⋮ Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems ⋮ Prefix graphs and their applications ⋮ On a compaction theorem of Ragde ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness

Cites Work

• A guided tour of Chernoff bounds
• Fast parallel space allocation, estimation, and integer sorting
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item