Analysis of parallel uniform hashing

DOI10.1016/0020-0190(91)90135-5MaRDI QIDQ750157zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90135-5

zbMATH Keywords

analysis of algorithmsdata structuresparallel algorithmsPRAM modelhash table

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Uniform Hashing in Constant Time and Optimal Space
• Simple Fast Parallel Hashing by Oblivious Execution
• Analysis of random probing hashing
• Simple fast parallel hashing

Cites work

• scientific article; zbMATH DE number 3825195 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Parallelism in random access machines
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Storing a Sparse Table with 0 (1) Worst Case Access Time

Cited in

(5)

• Parallel Hashing via List Recoverability
• A NEW HASHING ALGORITHM FOR PARALLEL PROCESSORS
• Analysis of the Parallel Distinguished Point Tradeoff
• Parallel hashing
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING

This page was built for publication: Analysis of parallel uniform hashing

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