Simple Fast Parallel Hashing by Oblivious Execution

DOI10.1137/S0097539794291580MaRDI QIDQ4210113zbMATH OpenFDO

Authors Joseph (Yossi) Gil, Y. Matias

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

randomizationdata structuresparallel computationhashing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Database theory (68P15) Distributed algorithms (68W15)

Recommendations

• Simple fast parallel hashing
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Parallel hashing
• Analysis of parallel uniform hashing

Cited in

(9)

• Parallel Hashing via List Recoverability
• Simple fast parallel hashing
• An optimal parallel dictionary
• A perfect parallel dictionary
• Analysis of parallel uniform hashing
• Hopscotch Hashing
• Parallel hashing
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Distributed Computing

This page was built for publication: Simple Fast Parallel Hashing by Oblivious Execution

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