Balanced families of perfect hash functions and their applications
From MaRDI portal
Publication:2930337
DOI10.1145/1798596.1798607zbMath1300.68062arXiv0805.4300OpenAlexW1980074516MaRDI QIDQ2930337
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.4300
No records found.
No records found.
Related Items (8)
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ Unnamed Item ⋮ Faster algorithms for finding and counting subgraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space
This page was built for publication: Balanced families of perfect hash functions and their applications
