| 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
Discrete Mathematics | 2023-11-27 | Paper |
\((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's
Lecture Notes in Computer Science | 2023-08-04 | Paper |
The complexity of grid coloring
Theory of Computing Systems | 2023-07-26 | Paper |
| Big Ramsey Degrees of Countable Ordinals | 2023-05-11 | Paper |
Unbounded search and recursive graph problems
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
| Hilbert's tenth problem for fixed \(d\) and \(n\) | 2022-04-19 | Paper |
| scientific article; zbMATH DE number 7377986 (Why is no real title available?) | 2021-08-03 | Paper |
Low, Superlow, and Superduperlow Sets: An Exposition of a Known But Not Well-Known Result
(available as arXiv preprint) | 2021-08-03 | Paper |
| Hilbert's Tenth Problem: Refinements and Variants | 2021-04-14 | Paper |
Mathematical muffin morsels. Nobody wants a small piece
Problem Solving in Mathematics and Beyond | 2020-04-02 | Paper |
| NIM with Cash: A Concrete Approach | 2019-11-01 | Paper |
The coefficient-choosing game
(available as arXiv preprint) | 2019-09-12 | Paper |
Distinct volume subsets via indiscernibles
Archive for Mathematical Logic | 2019-03-27 | Paper |
| Problems with a point. Exploring math and computer science | 2019-01-21 | Paper |
Measure, category and learning theory
Automata, Languages and Programming | 2019-01-10 | Paper |
Hilbert’s Proof of His Irreducibility Theorem
The American Mathematical Monthly | 2018-07-11 | Paper |
| Monochromatic rectangles in grid colorings | 2018-04-23 | Paper |
| The Muffin Problem | 2017-09-07 | Paper |
Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
On the sizes of DPDAs, PDAs, LBAs
Theoretical Computer Science | 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
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Distinct volume subsets
SIAM Journal on Discrete Mathematics | 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
Information and Computation | 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
Automata, Languages and Programming | 2011-07-06 | Paper |
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
| Rectangle Free Coloring of Grids | 2010-05-20 | Paper |
The complexity of learning SUBSEQ(A)
Journal of Symbolic Logic | 2009-09-29 | Paper |
| scientific article; zbMATH DE number 5604104 (Why is no real title available?) | 2009-09-15 | Paper |
The complexity of finding SUBSEQ\((A)\)
Theory of Computing Systems | 2009-09-02 | Paper |
The Complexity of Learning SUBSEQ (A)
Lecture Notes in Computer Science | 2008-09-04 | Paper |
| scientific article; zbMATH DE number 5310455 (Why is no real title available?) | 2008-08-12 | Paper |
Finding large 3-free sets. I. The small \(n\) case
Journal of Computer and System Sciences | 2008-06-10 | Paper |
Inferring answers to queries
Journal of Computer and System Sciences | 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
Algorithms and Computation | 2008-04-24 | Paper |
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Lecture Notes in Computer Science | 2007-09-05 | Paper |
A tight lower bound for restricted PIR protocols
Computational Complexity | 2006-09-28 | Paper |
| scientific article; zbMATH DE number 2077167 (Why is no real title available?) | 2004-07-01 | Paper |
Some connections between bounded query classes and non-uniform complexity.
Information and Computation | 2004-03-14 | Paper |
Max and min limiters
Archive for Mathematical Logic | 2003-09-16 | Paper |
Constant time parallel sorting: An empirical view.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
When does a random Robin Hood win?
Theoretical Computer Science | 2003-08-17 | Paper |
A survey of constant time parallel sorting
Bulletin of the European Association for Theoretical Computer Science EATCS | 2003-07-15 | Paper |
Automata techniques for query inference machines
Annals of Pure and Applied Logic | 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
Journal of Computer and System Sciences | 2002-04-11 | Paper |
| scientific article; zbMATH DE number 1405575 (Why is no real title available?) | 2000-09-20 | Paper |
| scientific article; zbMATH DE number 1507556 (Why is no real title available?) | 2000-09-14 | Paper |
The complexity of ODDnA
Journal of Symbolic Logic | 2000-06-22 | Paper |
On the finiteness of the recursive chromatic number
Annals of Pure and Applied Logic | 2000-05-29 | Paper |
| scientific article; zbMATH DE number 1303203 (Why is no real title available?) | 2000-05-15 | Paper |
Bounded queries in recursion theory
Progress in Computer Science and Applied Logic | 1999-11-02 | Paper |
scientific article; zbMATH DE number 1332674 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
Reverse Mathematics and Recursive Graph Theory
Mathematical Logic Quarterly | 1999-08-19 | Paper |
Classification using information
Annals of Mathematics and Artificial Intelligence | 1999-01-06 | Paper |
On the relative sizes of learnable sets
Theoretical Computer Science | 1998-08-13 | Paper |
Binary search and recursive graph problems
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1051236 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1104340 (Why is no real title available?) | 1998-05-29 | Paper |
| scientific article; zbMATH DE number 1114037 (Why is no real title available?) | 1998-05-10 | Paper |
| scientific article; zbMATH DE number 1048043 (Why is no real title available?) | 1997-09-22 | Paper |
On Bounded Queries and Approximation
SIAM Journal on Computing | 1997-08-03 | Paper |
Frequency computation and bounded queries
Theoretical Computer Science | 1997-02-27 | Paper |
Recursion theoretic models of learning: Some results and intuitions
Annals of Mathematics and Artificial Intelligence | 1996-10-20 | Paper |
| scientific article; zbMATH DE number 809154 (Why is no real title available?) | 1996-01-28 | Paper |
| scientific article; zbMATH DE number 749926 (Why is no real title available?) | 1995-11-09 | Paper |
| scientific article; zbMATH DE number 762059 (Why is no real title available?) | 1995-07-05 | Paper |
The structure of the honest polynomial m-degrees
Annals of Pure and Applied Logic | 1995-01-09 | Paper |
Learning via queries
Journal of the ACM | 1994-08-21 | Paper |
Extremes in the degrees of inferability
Annals of Pure and Applied Logic | 1994-05-03 | Paper |
On checking versus evaluation of multiple queries
Information and Computation | 1993-08-30 | Paper |
Terse, superterse, and verbose sets
Information and Computation | 1993-06-29 | Paper |
Selection problems via \(m\)-ary queries
Computational Complexity | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 92608 (Why is no real title available?) | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 67621 (Why is no real title available?) | 1992-09-27 | Paper |
Learning via queries in [+, <]
Journal of Symbolic Logic | 1992-09-27 | Paper |
The Mapmaker's dilemma
Discrete Applied Mathematics | 1992-06-28 | Paper |
On selecting the \(k\) largest with restricted quadratic queries
Information Processing Letters | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 18631 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4105024 (Why is no real title available?) | 1989-01-01 | Paper |
Training sequences
Theoretical Computer Science | 1989-01-01 | Paper |
Bounded query classes and the difference hierarchy
Archive for Mathematical Logic | 1989-01-01 | Paper |
On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Nondeterministic bounded query reducibilities
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Polynomial terse sets
Information and Computation | 1988-01-01 | Paper |
On the inference of sequences of functions
Analogical and Inductive Inference | 1987-01-01 | Paper |
Oracles for Deterministic Versus Alternating Classes
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4074484 (Why is no real title available?) | 1987-01-01 | Paper |
Relativizations comparing NP and exponential time
Information and Control | 1983-01-01 | Paper |
The Induced Bipartite Ramsey Theorem: An Exposition
(available as arXiv preprint) | N/A | Paper |
