Skip to main navigation Skip to search Skip to main content

Linear time constructions of some d-restriction problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings
EditorsPeter Widmayer, Vangelis Th. Paschos
Pages74-88
Number of pages15
DOIs
StatePublished - 2015
Event9th International Conference on Algorithms and Complexity, CIAC 2015 - Paris, France
Duration: 20 May 201522 May 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9079

Conference

Conference9th International Conference on Algorithms and Complexity, CIAC 2015
Country/TerritoryFrance
CityParis
Period20/05/1522/05/15

Keywords

  • Cover-free families
  • D-Restriction problems
  • Derandomization
  • Perfect hash
  • Separating hash functions

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this