2-source dispersers for n^o(1) entropy, and Ramsey graphs beating the Frankl-Wilson construction
From MaRDI portal
Publication:1928613
Recommendations
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Towards optimal two-source extractors and Ramsey graphs
- Simulating independence
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- An entropic proof of cutoff on Ramanujan graphs
- On the degeneracy of the Randić entropy and related graph measures
- A note on the von Neumann entropy of random graphs
- The entropy of random-free graphons and properties
Cites work
- A sum-product estimate in finite fields, and applications
- Better extractors for better codes?
- Constructing Ramsey graphs from Boolean function representations
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extracting Randomness Using Few Independent Sources
- Extracting Randomness via Repeated Condensing
- Extractor Codes
- Extractors
- Extractors and pseudorandom generators
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Extractors with weak random seeds
- Generating quasi-random sequences from semi-random sources
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 2196516 (Why is no real title available?)
- Intersection theorems with geometric consequences
- Low rank co-diagonal matrices and Ramsey graphs
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- On data structures and asymmetric communication complexity
- Randomness conductors and constant-degree lossless expanders
- Simulating independence
- The Shannon capacity of a union
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(27)- How to extract useful randomness from unreliable sources
- Extractors for small zero-fixing sources
- Explicit two-source extractors and resilient functions
- Distinct degrees and homogeneous sets
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Local correlation breakers and applications to three-source extractors and mergers
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Induced subgraphs with many distinct degrees
- Towards optimal two-source extractors and Ramsey graphs
- Large cliques and independent sets all over the place
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Extracting Randomness Using Few Independent Sources
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- A bipartite version of the Erdős–McKay conjecture
- Nearly optimal pseudorandomness from hardness
- Coloring tournaments with few colors: algorithms and complexity
- Seed-protecting extractors
- An exponential improvement for Ramsey lower bounds
This page was built for publication: 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928613)
