| Publication | Date of Publication | Type |
|---|
| On SAT Solvers and Ramsey-type Numbers | 2023-12-02 | Paper |
| Fermat's last theorem, Schur's theorem (in Ramsey theory), and the infinitude of the primes | 2023-11-27 | Paper |
| \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's | 2023-08-04 | Paper |
| The complexity of grid coloring | 2023-07-26 | Paper |
| Big Ramsey Degrees of Countable Ordinals | 2023-05-11 | Paper |
| Unbounded search and recursive graph problems | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5071023 | 2022-04-19 | Paper |
| Low, Superlow, and Superduperlow Sets: An Exposition of a Known But Not Well-Known Result | 2021-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5004969 | 2021-08-03 | Paper |
| Hilbert's Tenth Problem: Refinements and Variants | 2021-04-14 | Paper |
| Mathematical Muffin Morsels | 2020-04-02 | Paper |
| NIM with Cash: A Concrete Approach | 2019-11-01 | Paper |
| The Coefficient-Choosing Game | 2019-09-12 | Paper |
| Distinct volume subsets via indiscernibles | 2019-03-27 | Paper |
| Problems with a Point | 2019-01-21 | Paper |
| Measure, category and learning theory | 2019-01-10 | Paper |
| Hilbert’s Proof of His Irreducibility Theorem | 2018-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636181 | 2018-04-23 | Paper |
| The Muffin Problem | 2017-09-07 | Paper |
| Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems | 2016-10-24 | Paper |
| On the sizes of DPDAs, PDAs, LBAs | 2016-06-16 | Paper |
| NIM with Cash | 2015-11-12 | Paper |
| Which Unbounded Protocol for Envy Free Cake Cutting is Better? | 2015-07-28 | Paper |
| Three Results on Making Change (An Exposition) | 2015-07-15 | Paper |
| Distinct Volume Subsets | 2015-05-20 | Paper |
| A Sane Proof that COLk \le COL3 | 2014-07-18 | Paper |
| How many ways can you make change: Some easy proofs | 2014-06-19 | Paper |
| Limits on the computational power of random strings | 2013-06-06 | Paper |
| Applications of the Canonical Ramsey Theorem to Geometry | 2013-02-21 | Paper |
| New Upper and Lower Bounds on the Rado Numbers | 2012-06-21 | Paper |
| Three Proofs of the Hypergraph Ramsey Theorem (An exposition) | 2012-06-19 | Paper |
| A Statement in Combinatorics that is Independent of ZFC (an exposition) | 2012-01-05 | Paper |
| Proving programs terminate using well orderings, Ramsey Theory, and Matrices | 2011-08-16 | Paper |
| Limits on the Computational Power of Random Strings | 2011-07-06 | Paper |
| Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive | 2011-06-01 | Paper |
| Rectangle Free Coloring of Grids | 2010-05-20 | Paper |
| The complexity of learning SUBSEQ(A) | 2009-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395988 | 2009-09-15 | Paper |
| The complexity of finding SUBSEQ\((A)\) | 2009-09-02 | Paper |
| The Complexity of Learning SUBSEQ (A) | 2008-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517634 | 2008-08-12 | Paper |
| Inferring answers to queries | 2008-06-10 | Paper |
| Finding large 3-free sets. I. The small \(n\) case | 2008-06-10 | Paper |
| Square-Difference-Free Sets of Size Omega(n^{0.7334...}) | 2008-04-30 | Paper |
| Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems | 2008-04-24 | Paper |
| The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems | 2007-09-05 | Paper |
| A tight lower bound for restricted PIR protocols | 2006-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470560 | 2004-07-01 | Paper |
| Some connections between bounded query classes and non-uniform complexity. | 2004-03-14 | Paper |
| Max and min limiters | 2003-09-16 | Paper |
| Constant time parallel sorting: An empirical view. | 2003-08-19 | Paper |
| When does a random Robin Hood win? | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729228 | 2003-07-15 | Paper |
| Automata techniques for query inference machines | 2002-12-02 | Paper |
| When Can One Load a Set of Dice so That the Sum Is Uniformly Distributed? | 2002-11-10 | Paper |
| The communication complexity of enumeration, elimination, and selection | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938554 | 2000-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504216 | 2000-09-14 | Paper |
| The complexity of ODDnA | 2000-06-22 | Paper |
| On the finiteness of the recursive chromatic number | 2000-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249726 | 2000-05-15 | Paper |
| Bounded queries in recursion theory | 1999-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259996 | 1999-09-08 | Paper |
| Reverse Mathematics and Recursive Graph Theory | 1999-08-19 | Paper |
| Classification using information | 1999-01-06 | Paper |
| On the relative sizes of learnable sets | 1998-08-13 | Paper |
| Binary search and recursive graph problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349576 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370213 | 1998-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375806 | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348129 | 1997-09-22 | Paper |
| On Bounded Queries and Approximation | 1997-08-03 | Paper |
| Frequency computation and bounded queries | 1997-02-27 | Paper |
| Recursion theoretic models of learning: Some results and intuitions | 1996-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852904 | 1996-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764107 | 1995-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4835903 | 1995-07-05 | Paper |
| The structure of the honest polynomial m-degrees | 1995-01-09 | Paper |
| Learning via queries | 1994-08-21 | Paper |
| Extremes in the degrees of inferability | 1994-05-03 | Paper |
| On checking versus evaluation of multiple queries | 1993-08-30 | Paper |
| Terse, superterse, and verbose sets | 1993-06-29 | Paper |
| Selection problems via \(m\)-ary queries | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018074 | 1993-01-16 | Paper |
| Learning via queries in [+, <] | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013540 | 1992-09-27 | Paper |
| The Mapmaker's dilemma | 1992-06-28 | Paper |
| On selecting the \(k\) largest with restricted quadratic queries | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976034 | 1992-06-26 | Paper |
| Training sequences | 1989-01-01 | Paper |
| On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case | 1989-01-01 | Paper |
| Bounded query classes and the difference hierarchy | 1989-01-01 | Paper |
| Nondeterministic bounded query reducibilities | 1989-01-01 | Paper |
| On the complexity of finding the chromatic number of a recursive graph. I: The bounded case | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829588 | 1989-01-01 | Paper |
| Polynomial terse sets | 1988-01-01 | Paper |
| On the inference of sequences of functions | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805900 | 1987-01-01 | Paper |
| Oracles for Deterministic Versus Alternating Classes | 1987-01-01 | Paper |
| Relativizations comparing NP and exponential time | 1983-01-01 | Paper |
