A perfect parallel dictionary

DOI10.1007/3-540-55808-X_11zbMath1493.68134OpenAlexW1490438579MaRDI QIDQ5096824

Torben Hagerup, Martin Dietzfelbinger, Holger Bast

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_11

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Related Items (3)

A design of a parallel dictionary using skip lists ⋮ Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems ⋮ Perfect hashing

Cites Work

• Unnamed Item
• Unnamed Item
• Fast parallel space allocation, estimation, and integer sorting
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• An O(logn) parallel connectivity algorithm
• On parallel hashing and integer sorting
• The log-star revolution

This page was built for publication: A perfect parallel dictionary