Simple fast parallel hashing

DOI10.1007/3-540-58201-0_72zbMath1418.68236OpenAlexW1503154078MaRDI QIDQ4632430

Joseph (Yossi) Gil, Yossi Matias

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_72

zbMATH Keywords

parallel algorithmhash functionhash tablememory blockiteration body

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Efficient low-contention parallel algorithms
• On the power of two-point based sampling
• An optimal parallel dictionary
• Universal classes of hash functions
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Relations between Concurrent-Write Models of Parallel Computation
• On parallel hashing and integer sorting
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Polynomial hash functions are reliable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple fast parallel hashing