No label defined (Q5092448)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7561729

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561729

Statements

scholarly article

0 references

Avraham Ben-Aroya

0 references

0 references

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

dispersers

0 references

erasure codes

0 references

list decoding

0 references

Ramsey graphs

0 references

two-source extractors

0 references

MaRDI profile type

MaRDI publication profile

0 references

Lower bounds for some Ramsey numbers

0 references

The Shannon capacity of a union

0 references

Almost \(k\)-wise independence versus \(k\)-wise independence

0 references

Simulating independence

0 references

2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction

0 references

An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy

0 references

MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS

0 references

Explicit two-source extractors and resilient functions

0 references

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

0 references

A note on constructive methods for ramsey numbers

0 references

Local Correlation Breakers and Applications to Three-Source Extractors and Mergers

0 references

Non-malleable extractors: new tools and improved constructions

0 references

Two-source dispersers for polylogarithmic entropy and improved ramsey graphs

0 references

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

0 references

Kakeya Sets, New Mergers, and Old Extractors

0 references

Some remarks on the theory of graphs

0 references

0 references

Intersection theorems with geometric consequences

0 references

Constructing Ramsey graphs from Boolean function representations

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

0 references

List decoding from erasures: bounds and code constructions

0 references

Better extractors for better codes?

0 references

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets

0 references

Improved non-malleable extractors, non-malleable codes and independent source extractors

0 references

0 references

Recent advances on the log-rank conjecture in communication complexity

0 references

Communication is Bounded by Root of Rank

0 references

Explicit Resilient Functions Matching Ajtai-Linial

0 references

Deterministic coupon collection and better strong dispersers

0 references

0 references

On rank vs. communication complexity

0 references

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

0 references

Extractors with weak random seeds

0 references

0 references

An Introduction to Randomness Extractors

0 references

Extractors and pseudorandom generators

0 references

Randomness extractors - applications and constructions

0 references

Simulating BPP using a general weak random source

0 references

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.CCC.2020.1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5092448

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5092448&oldid=39529662"