scientific article; zbMATH DE number 7378642

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.30zbMath1476.68080MaRDI QIDQ5009525

Omid Etesami, Siyao Guo, Andrej Bogdanov, Salman Beigi

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

martingalesextractor lower boundsfeasibility of randomness extraction

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20)

Related Items (1)

How to extract useful randomness from unreliable sources

Cites Work

• Unnamed Item
• Extractors and rank extractors for polynomial sources
• On the construction of affine extractors
• Generating quasi-random sequences from semi-random sources
• Blockwise \(p\)-tampering attacks on cryptographic primitives, extractors, and learners
• Extractors for varieties
• Pseudorandomness
• Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Explicit two-source extractors and resilient functions

This page was built for publication: