Two results on tables

DOI10.1016/0020-0190(86)90041-4zbMATH Open0584.68066OpenAlexW2055618684MaRDI QIDQ1069703FDOQ1069703

Peter van Emde Boas, Christiaan T. M. Jacobs

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

Recommendations

• scientific article; zbMATH DE number 1875411
• The effect of table expansion on the program complexity of perfect hash functions
• scientific article; zbMATH DE number 1688373
• Collections of Functions for Perfect Hashing
• Simple and Space-Efficient Minimal Perfect Hash Functions

zbMATH Keywords

perfect hashingsingle-probe table lookup strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Title not available (Why is that?)
• Should Tables Be Sorted?

Cited In (10)

• Polynomial hash functions are reliable
• Improved bounds for dictionary look-up with one error
• The problem of space invariance for sequential machines
• Title not available (Why is that?)
• Graphs, hypergraphs and hashing
• The effect of table expansion on the program complexity of perfect hash functions
• Tables should be sorted (on random access machines)
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• Perfect hashing
• Implicit $O(1)$ Probe Search

This page was built for publication: Two results on tables

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