Balanced families of perfect hash functions and their applications
From MaRDI portal
Publication:2930337
DOI10.1145/1798596.1798607zbMath1300.68062arXiv0805.4300OpenAlexW1980074516MaRDI QIDQ2930337
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.4300
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
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