scientific article; zbMATH DE number 7561729
From MaRDI portal
Publication:5092448
DOI10.4230/LIPIcs.CCC.2020.1MaRDI QIDQ5092448
Amnon Ta-Shma, Dean Doron, Avraham Ben-Aroya
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing Ramsey graphs from Boolean function representations
- Almost \(k\)-wise independence versus \(k\)-wise independence
- Intersection theorems with geometric consequences
- The Shannon capacity of a union
- On rank vs. communication complexity
- Simulating BPP using a general weak random source
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Explicit two-source extractors and resilient functions
- Randomness extractors - applications and constructions
- Deterministic coupon collection and better strong dispersers
- An Introduction to Randomness Extractors
- Kakeya Sets, New Mergers, and Old Extractors
- Communication is Bounded by Root of Rank
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
- List decoding from erasures: bounds and code constructions
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Better extractors for better codes?
- 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
- Recent advances on the log-rank conjecture in communication complexity
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- 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: new tools and improved constructions
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Extractors and pseudorandom generators
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Some remarks on the theory of graphs
- Simulating independence
- Lower bounds for some Ramsey numbers
