Two results on tables

DOI10.1016/0020-0190(86)90041-4MaRDI QIDQ1069703zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• Should Tables Be Sorted?
• Storing a Sparse Table with 0 (1) Worst Case Access Time

Cited in

(10)

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

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)