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)

Full work available at URL https://doi.org/10.1137/S0097539794291580

zbMATH Keywords

data structureshashingparallel computationrandomization

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(10)

• An optimal parallel dictionary
• Parallel Hashing via List Recoverability
• Hopscotch Hashing
• Parallel hashing
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Simple fast parallel hashing
• The Tree Model for Hashing: Lower and Upper Bounds
• A perfect parallel dictionary
• Distributed Computing
• Analysis of parallel uniform hashing

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)