An optimal parallel dictionary

DOI10.1006/INCO.1993.1007MaRDI QIDQ1207956zbMATH OpenOpenAlexFDO

Authors Martin Dietzfelbinger, Friedhelm Meyer auf der Heide

Publication date 16 May 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1993.1007

zbMATH Keywords

dynamic data structureparallel dictionarysequential dynamic hashing

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• A perfect parallel dictionary
• scientific article; zbMATH DE number 4129963
• Simple Fast Parallel Hashing by Oblivious Execution
• A design of a parallel dictionary using skip lists
• Deterministic dictionaries

Cited in

(9)

• Parallel dictionaries using AVL trees
• A design of a parallel dictionary using skip lists
• Perfect hashing
• Parallel dictionaries with local rules on AVL and brother trees
• scientific article; zbMATH DE number 4129963 (Why is no real title available?)
• Dictionary Machine with Improved Performance
• Low-contention data structures
• Simple fast parallel hashing
• A perfect parallel dictionary

This page was built for publication: An optimal parallel dictionary

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