Two results on tables

DOI10.1016/0020-0190(86)90041-4zbMath0584.68066OpenAlexW2055618684MaRDI QIDQ1069703

Christiaan T. M. Jacobs, Peter van Emde Boas

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90041-4

zbMATH Keywords

perfect hashingsingle-probe table lookup strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Improved bounds for dictionary look-up with one error ⋮ The problem of space invariance for sequential machines ⋮ Perfect hashing ⋮ Graphs, hypergraphs and hashing ⋮ Polynomial hash functions are reliable ⋮ Unnamed Item

Cites Work

• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Should Tables Be Sorted?
• Unnamed Item

This page was built for publication: Two results on tables