scientific article; zbMATH DE number 7561729
From MaRDI portal
Publication:5092448
Cites work
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- A note on constructive methods for ramsey numbers
- Almost \(k\)-wise independence versus \(k\)-wise independence
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- An introduction to randomness extractors
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Better extractors for better codes?
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Constructing Ramsey graphs from Boolean function representations
- Deterministic coupon collection and better strong dispersers
- Explicit Resilient Functions Matching Ajtai-Linial
- Explicit two-source extractors and resilient functions
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- Extractors and pseudorandom generators
- Extractors with weak random seeds
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 3616470 (Why is no real title available?)
- scientific article; zbMATH DE number 2081105 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Intersection theorems with geometric consequences
- Kakeya sets, new mergers, and old extractors
- Linear degree extractors and the inapproximability of max clique and chromatic number
- List decoding from erasures: bounds and code constructions
- Local correlation breakers and applications to three-source extractors and mergers
- Lower bounds for some Ramsey numbers
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Non-malleable extractors: new tools and improved constructions
- On rank vs. communication complexity
- Randomness extractors -- applications and constructions
- Recent advances on the log-rank conjecture in communication complexity
- Simulating BPP using a general weak random source
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Some remarks on the theory of graphs
- The Shannon capacity of a union
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(11)- Almost disjunctive list-decoding codes
- Optimal Rate List Decoding via Derivative Codes
- Minimax Universal Decoding With an Erasure Option
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Folded codes from function field towers and improved optimal rate list decoding
- Optimal explicit small-depth formulas for the coin problem
- Erasure list-decodable codes and Turán hypercube problems
- Pauli manipulation detection codes and applications to quantum communication over adversarial channels
- Seed-protecting extractors
- Bit-fixing extractors for almost-logarithmic entropy
- List-recovery of random linear codes over small fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092448)
