Deterministic coupon collection and better strong dispersers

DOI10.4230/LIPICS.APPROX-RANDOM.2014.872zbMath1359.68140OpenAlexW2125952912MaRDI QIDQ2969668

Yuan Zhou, Omer Reingold, Raghu Meka

Publication date: 22 March 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.872

zbMATH Keywords

hashingcoupon collectionpseudorandomnessdispersersstrong dispersers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

Optimal explicit small-depth formulas for the coin problem ⋮ Unnamed Item

This page was built for publication: Deterministic coupon collection and better strong dispersers