Abstract
AbstractWe give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.KeywordsDerandomization \(d\)-Restriction problemsPerfect hashCover-free familiesSeparating hash functions
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
