Pages that link to "Item:Q5757458"
From MaRDI portal
The following pages link to Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed (Q5757458):
Displaying 23 items.
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- Extractors for varieties (Q1926108) (← links)
- Deterministic extraction from weak random sources. (Q1958398) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Extractors for small zero-fixing sources (Q2095117) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- On randomness extraction in \({\mathcal{AC}}^0\) (Q4601849) (← links)
- On extractors and exposure‐resilient functions for sublogarithmic entropy (Q4921889) (← links)
- (Q5009532) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Proved Random Numbers Obtained from Hardware Devices (Q5415900) (← links)
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification (Q5502802) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
