Linear Hashing Is Awesome

DOI10.1137/17M1126801zbMath1422.68048arXiv1706.02783OpenAlexW2943258916WikidataQ127964994 ScholiaQ127964994MaRDI QIDQ4634035

Mathias Bæk Tejs Knudsen

Publication date: 7 May 2019

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

Full work available at URL: https://arxiv.org/abs/1706.02783

zbMATH Keywords

hashinglinear hashinghashing with chaining

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Universal classes of hash functions
• Linear hash functions
• A Reliable Randomized Algorithm for the Closest-Pair Problem

This page was built for publication: Linear Hashing Is Awesome