scientific article; zbMATH DE number 7250143
From MaRDI portal
Publication:5121891
DOI10.4230/LIPIcs.CCC.2018.3zbMath1441.68034MaRDI QIDQ5121891
Avraham Ben-Aroya, Dean Doron, Eshan Chattopadhyay, Amnon Ta-Shma, Xin Li
Publication date: 22 September 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (4)
Improved computational extractors and their applications ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Unnamed Item ⋮ How to extract useful randomness from unreliable sources
Cites Work
- Unnamed Item
- Intersection theorems with geometric consequences
- The Shannon capacity of a union
- The dichromatic number of a digraph
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Low rank co-diagonal matrices and Ramsey graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- A note on constructive methods for ramsey numbers
- Explicit Resilient Functions Matching Ajtai-Linial
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- Non-malleable extractors and symmetric key cryptography from weak secrets
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
- Non-malleable extractors and codes, with their many tampered extensions
- Explicit two-source extractors and resilient functions
- Non-malleable extractors: new tools and improved constructions
- Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
- Simulating independence
- Lower bounds for some Ramsey numbers
This page was built for publication:
