Balanced Families of Perfect Hash Functions and Their Applications

DOI10.1007/978-3-540-73420-8_39MaRDI QIDQ5428829zbMATH OpenOpenAlexFDO

Authors Noga Alon, Shai Gutner

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_39

zbMATH Keywords

approximate counting of subgraphscolor-codingperfect hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Balanced families of perfect hash functions and their applications
• Structures of a type of perfect hash function family
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect Hash Families: Constructions and Existence
• On a family of universal hash functions
• A new lower bound on perfect hash families
• Fractal perfect hash families (extended abstract)
• On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
• Perfect hash families: the generalization to higher indices
• Explicit constructions for perfect hash families

Cited in

(5)

• Algorithmic methods for covering arrays of higher index
• Balanced families of perfect hash functions and their applications
• The Budgeted Unique Coverage Problem and Color-Coding
• Balanced hashing, color coding and approximate counting
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings

This page was built for publication: Balanced Families of Perfect Hash Functions and Their Applications

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