Balanced Families of Perfect Hash Functions and Their Applications

DOI10.1007/978-3-540-73420-8_39zbMath1171.68868OpenAlexW1643506661MaRDI QIDQ5428829

Shai Gutner, Noga Alon

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

color-codingperfect hashingapproximate counting of subgraphs

Mathematics Subject Classification ID

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

Related Items (3)

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Balanced Hashing, Color Coding and Approximate Counting ⋮ Algorithmic methods for covering arrays of higher index

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