Constructive Ramsey Numbers
Intersection Thms with Geometric Consequences. Frankl and Wilson. 1981
Representing bool Fns as pols mod composite numbers. Barrington-Beigel-Rudich. 1993
A Note on Const Lower bounds for the Ramsey Number R(3,t). Chung, Cleve, Dagum. 1993
The Shannon Capacit of a Union. Alon. 1998 (This is used in other papers.)
Extractors and Psuedorandom Generators. Trevisan. 2001
Superpoly size set-systems with restriced intersections mod 6 and explicity Ramsey graphs. Grolmusz. 2000
Const lower bounds for off-diagonal Ramsey numbers. Alon-Pudlak. 2001
Constructing set-systems with prescribed intersection sizes. Grolmusz. 2001
2-source dispersers, sub-poly entropy, and Ramsey graphs beating the FW construction. Barak, Rao, Shaltiel, Wigderson
Pseudorandom set and explicity consts of Ramsey graphs. Pudlak and Rodl. 2004
Constructing Ramsey graphs from Boolean function representation. Gopalan. 2006
On explicit Ramsey graphs and estimates of the number of sums and products. Pudlak. 2006
Some constructive bounds on Ramsey numbers. Kostochka, Pudlak, Rodl. 2010
More const lower bds on classical Ramsey Numbers. 2011
Explicit two-source extractors and resilient functions.Chattopadhyay and Zuckerman. 2015
Two-Source Dispersers for Polylog Entropy and Improved Ramsey Graphs. Cohen. 2016
Improved Non-Malleable Extractors, Non-Malleable Codes and Ind. Source Extractors. Li. 2016
Non-Malleable Extractors and Non-Malleable Codes: Partially Opt Constructions. Li. 2018
Two Source Extractors for Asy Opt Entroy, and (Many) More. 2023