Almost optimal dispersers

DOI10.1007/S004930200006MaRDI QIDQ1603264zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Amnon Ta-Shma

Publication date 25 June 2002

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004930200006

zbMATH Keywords

optimal dispersers

Mathematics Subject Classification ID

General topics in the theory of computing (68Q01) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1775404
• scientific article; zbMATH DE number 1263224
• Dispersing Hash functions
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Explicit OR-dispersers with polylogarithmic degree

Cited in

(6)

• The fine art of surfacing: its efficacy in broadcast spawning
• An introduction to randomness extractors
• Explicit OR-dispersers with polylogarithmic degree
• scientific article; zbMATH DE number 1263224 (Why is no real title available?)
• scientific article; zbMATH DE number 1775404 (Why is no real title available?)
• Integrality gaps and approximation algorithms for dispersers and bipartite expanders

This page was built for publication: Almost optimal dispersers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603264)