### 15 papers:

- RTA-TLCA-2014-BerardiS #theorem
- Ramsey Theorem as an Intuitionistic Property of Well Founded Relations (SB, SS), pp. 93–107.
- TACAS-2013-CookSZ #proving #termination
- Ramsey vs. Lexicographic Termination Proving (BC, AS, FZ), pp. 47–61.
- ICALP-v1-2013-LauriaPRT #complexity #graph #proving
- The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
- ICALP-v2-2013-FriedmannKL #automaton
- Ramsey Goes Visibly Pushdown (OF, FK, ML), pp. 224–237.
- SAT-2013-Lauria #bound #proving #rank #theorem
- A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.
- FoSSaCS-2012-BreuersLO #automaton
- Improved Ramsey-Based Büchi Complementation (SB, CL, JO), pp. 150–164.
- TACAS-2012-FriedmannL #analysis #automaton
- Ramsey-Based Analysis of Parity Automata (OF, ML), pp. 64–78.
- CAV-2010-AbdullaCCHHMV #automaton #simulation #testing
- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
- STOC-2006-BarakRSW #graph
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (BB, AR, RS, AW), pp. 671–680.
- STOC-2005-BarakKSSW #graph #independence #simulation
- Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors (BB, GK, RS, BS, AW), pp. 1–10.
- STOC-2003-BartalLMN #metric #on the
- On metric ramsey-type phenomena (YB, NL, MM, AN), pp. 463–472.
- SAC-2003-GondraS #algorithm #parallel #search-based
- A Coarse-Grain Parallel Genetic Algorithm for Finding Ramsey Numbers (IG, MHS), pp. 2–8.
- STOC-1999-Schaefer #graph #polynomial
- Graph Ramsey Theory and the Polynomial Hierarchy (MS), pp. 592–601.
- KR-1992-Boutilier
- Normative, Subjunctive, and Autoepistemic Defaults: Adopting the Ramsey Test (CB), pp. 685–696.
- CSL-1990-Pudlak #bound #theorem
- Ramsey’s Theorem in Bounded Arithmetic (PP), pp. 308–317.