scientific article; zbMATH DE number 1097580
From MaRDI portal
Publication:4372786
DOI<345::AID-RSA4>3.0.CO;2-Z 10.1002/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-ZzbMath0891.60100MaRDI QIDQ4372786
Publication date: 19 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources ⋮ Extractors for weak random sources and their applications ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ Derandomized parallel repetition theorems for free games ⋮ Low-degree test with polynomially small error ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Computational indistinguishability: A sample hierarchy ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Innovative approaches for security of small artefacts ⋮ Must the communication graph of MPC protocols be an expander? ⋮ An Introduction to Randomness Extractors ⋮ Pseudorandom generators without the XOR lemma ⋮ Extractors from Reed-Muller codes ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Unnamed Item ⋮ On derandomized composition of Boolean functions ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Almost Optimal Explicit Johnson-Lindenstrauss Families ⋮ A Sample of Samplers: A Computational Perspective on Sampling ⋮ Typically-correct derandomization for small time and space ⋮ Explicit two-source extractors and resilient functions ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace ⋮ List-Decoding with Double Samplers ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds
