Analysis of parallel uniform hashing

DOI10.1016/0020-0190(91)90135-5zbMATH Open0713.68031OpenAlexW2017948611MaRDI QIDQ750157FDOQ750157

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

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

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)

Cites Work

• Title not available (Why is that?)
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Title not available (Why is that?)
• Parallelism in random access machines

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)