Pages that link to "Item:Q5361870"
From MaRDI portal
The following pages link to Explicit two-source extractors and resilient functions (Q5361870):
Displaying 37 items.
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- Low error efficient computational extractors in the CRS model (Q2055616) (← links)
- Multi-source non-malleable extractors and applications (Q2056748) (← links)
- Extractors for small zero-fixing sources (Q2095117) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Improved computational extractors and their applications (Q2129010) (← links)
- No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers (Q3187171) (← links)
- Towards a Theory of Extractable Functions (Q3611790) (← links)
- Induced Subgraphs With Many Distinct Degrees (Q4601057) (← links)
- On extractors and exposure‐resilient functions for sublogarithmic entropy (Q4921889) (← links)
- Towards optimal two-source extractors and Ramsey graphs (Q4978055) (← links)
- Large cliques and independent sets all over the place (Q4992901) (← links)
- Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
- (Q5009525) (← links)
- (Q5009532) (← links)
- (Q5009548) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
- (Q5090419) (← links)
- (Q5091215) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5091780) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- (Q5121891) (← links)
- An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs (Q5126775) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Counting rectangles and an improved restriction estimate for the paraboloid in $F_p^3$ (Q5218199) (← links)
- AN EXPLICIT TWO‐SOURCE EXTRACTOR WITH MIN‐ENTROPY RATE NEAR (Q5225826) (← links)
- Proof of a conjecture on induced subgraphs of Ramsey graphs (Q5240169) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- (Q5875499) (← links)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
- The work of Mark Braverman (Q6200321) (← links)
- Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study (Q6487354) (← links)
