Pages that link to "Item:Q5917498"
From MaRDI portal
The following pages link to Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498):
Displaying 19 items.
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Dispersing hash functions (Q3055765) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5090431) (← links)
- (Q5092470) (← links)
- Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
- Proved Random Numbers Obtained from Hardware Devices (Q5415900) (← links)
- (Q5875519) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
