Graphs, hypergraphs and hashing

DOI10.1007/3-540-57899-4_49MaRDI QIDQ6143973zbMATH OpenFDO

Authors George Havas, Bohdan S. Majewski, Nicholas Wormald, Zbigniew J. Czech

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57899-4_49

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Experimental and Efficient Algorithms
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Minimal perfect hashing in polynomial time
• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
• An optimal algorithm for generating minimal perfect hash functions

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4209577 (Why is no real title available?)
• scientific article; zbMATH DE number 3929049 (Why is no real title available?)
• scientific article; zbMATH DE number 88958 (Why is no real title available?)
• scientific article; zbMATH DE number 177800 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 370478 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• A Letter-oriented Minimal Perfect Hashing Scheme
• A backtracking method for constructing perfect hash functions from a set of mapping functions
• An algebraic approach to Cichelli's perfect hashing
• An optimal algorithm for generating minimal perfect hash functions
• Minimal perfect hashing in polynomial time
• Perfect hashing functions
• Polynomial hash functions are reliable (extended abstract)
• Reciprocal hashing
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Storing a sparse table
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• The Study of a New Perfect Hash Scheme
• Two results on tables
• Universal classes of hash functions

Cited in

(6)

• scientific article; zbMATH DE number 3910116 (Why is no real title available?)
• PSI from PaXoS: fast, malicious private set intersection
• Hash functions and Cayley graphs
• scientific article; zbMATH DE number 1737506 (Why is no real title available?)
• Hashing and canonicalizing Notation 3 graphs
• scientific article; zbMATH DE number 7525476 (Why is no real title available?)

This page was built for publication: Graphs, hypergraphs and hashing

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