Graphs, hypergraphs and hashing

DOI10.1007/3-540-57899-4_49zbMath1528.68092MaRDI QIDQ6143973

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

Publication date: 5 January 2024

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

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ PSI from PaXoS: fast, malicious private set intersection

Cites Work

• Minimal perfect hashing in polynomial time
• A backtracking method for constructing perfect hash functions from a set of mapping functions
• Two results on tables
• An optimal algorithm for generating minimal perfect hash functions
• Universal classes of hash functions
• An algebraic approach to Cichelli's perfect hashing
• Storing a sparse table
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• A Letter-oriented Minimal Perfect Hashing Scheme
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Reciprocal hashing
• Perfect hashing functions
• The Study of a New Perfect Hash Scheme
• Polynomial hash functions are reliable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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