Relativizations Comparing NP and Exponential Time - William I. Gasarch; Steven Homer (Inf. Control., 1983)

On the Inference of Sequences of Functions. - William I. Gasarch; Carl H. Smith (AII, 1986)

Oracles for Deterministic versus Alternating Classes. - William I. Gasarch (SIAM J. Comput., 1987)

Polynomial Terse Sets - Amihood Amir; William I. Gasarch (Inf. Comput., 1988)

On Honest Polynomial Reductions, Relativizations, and P=NP. - Rodney G. Downey; Steven Homer; William I. Gasarch; Michael F. Moses (SCT, 1989)

Learning via Queries to an Oracle. - William I. Gasarch; Mark G. Pleszkoch (COLT, 1989)

Bounded query classes and the difference hierarchy. - Richard Beigel; William I. Gasarch; Louise Hay (Arch. Math. Log., 1989)

On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case. - Richard Beigel; William I. Gasarch (Ann. Pure Appl. Log., 1989)

On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case. - Richard Beigel; William I. Gasarch (Ann. Pure Appl. Log., 1989)

Nondeterministic Bounded Query Reducibilities. - Richard Beigel; William I. Gasarch; James C. Owings (Ann. Pure Appl. Log., 1989)

Training Sequences. - Dana Angluin; William I. Gasarch; Carl H. Smith (Theor. Comput. Sci., 1989)

Learning Via Queries in [+, <]. - William I. Gasarch; Mark G. Pleszkoch; Robert Solovay (COLT, 1990)

Learning Via Queries With Teams and Anomilies. - Efim B. Kinber; William I. Gasarch; Thomas Zeugmann; Mark G. Pleszkoch; Carl H. Smith (COLT, 1990)

Bounded Queries in Recursion Theory: A Survey. - William I. Gasarch (SCT, 1991)

The Mapmaker's dilemma. - Richard Beigel; William I. Gasarch (Discret. Appl. Math., 1991)

On Selecting the k Largest with Restricted Quadratic Queries. - William I. Gasarch (Inf. Process. Lett., 1991)

Degrees of Inferability. - Peter Cholak; Efim B. Kinber; Rodney G. Downey; Martin Kummer; Lance Fortnow; Stuart A. Kurtz; William I. Gasarch; Theodore A. Slaman (COLT, 1992)

On the Number Components of a Recursive Graph. - William I. Gasarch; Katia S. Guimarães (LATIN, 1992)

Selection Problems via M-Ary Queries. - Katia S. Guimarães; William I. Gasarch; James M. Purtilo (Comput. Complex., 1992)

Learning programs with an easy to calculate set of errors. - William I. Gasarch; Ramesh K. Sitaraman; Carl H. Smith; Mahendran Velauthapillai (Fundam. Informaticae, 1992)

Learning via Queries. - William I. Gasarch; Carl H. Smith (J. ACM, 1992)

Learning vi Queries in [+, <]. - William I. Gasarch; Mark G. Pleszkoch; Robert Solovay (J. Symb. Log., 1992)

On Bounded Queries and Approximation - Richard Chang 001; William I. Gasarch (FOCS, 1993)

Terse, Superterse, and Verbose Sets - Richard Beigel; William I. Gasarch; John Gill; James C. Owings (Inf. Comput., 1993)

On Checking Versus Evaluation of Multiple Queries - William I. Gasarch; Lane A. Hemachandra; Albrecht Hoene (Inf. Comput., 1993)

Classification Using Information. - William I. Gasarch; Mark G. Pleszkoch; Mahendran Velauthapillai (AII/ALT, 1994)

The Structure of the Honest Polynomial m-Degrees. - Rodney G. Downey; William I. Gasarch; Michael F. Moses (Ann. Pure Appl. Log., 1994)

Extremes in the Degrees of Inferability. - Lance Fortnow; William I. Gasarch; Sanjay Jain 001; Efim B. Kinber; Martin Kummer; Stuart A. Kurtz; Mark Pleszkovich; Theodore A. Slaman; Robert Solovay; Frank Stephan 001 (Ann. Pure Appl. Log., 1994)

Book Review: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. $39.50.). - William I. Gasarch (SIGACT News, 1994)

On Finding the Number of Graph Automorphisms. - Richard Chang 001; William I. Gasarch; Jacobo Torán (SCT, 1995)

Reductions for Learning via Queries. - William I. Gasarch; Geoffrey R. Hird (COLT, 1995)

Measure, Category and Learning Theory. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (ICALP, 1995)

Unbounded Search and Recursive Graph Problems. - William I. Gasarch; Katia S. Guimarães (LATIN, 1995)

Recursion Theoretic Models of Learning: Some Results and Intuitions. - Carl H. Smith; William I. Gasarch (Ann. Math. Artif. Intell., 1995)

Learning via Queries with Teams and Anomalies. - William I. Gasarch; Efim B. Kinber; Mark G. Pleszkoch; Carl H. Smith; Thomas Zeugmann (Fundam. Informaticae, 1995)

OptP as the Normal Behavior of NP-Complete Problems. - William I. Gasarch; Mark W. Krentel; Kevin J. Rappoport (Math. Syst. Theory, 1995)

On the Query Complexity of Sets. - Richard Beigel; William I. Gasarch; Martin Kummer; Timothy H. McNicholl; Frank Stephan 001 (MFCS, 1996)

Implementing WS1S via Finite Automata. - James Glenn; William I. Gasarch (Workshop on Implementing Automata, 1996)

The Complexity of Problems. - William I. Gasarch (Adv. Comput., 1996)

Complexity Theory Newsflash. - Stephen A. Fenner; Lance Fortnow; William I. Gasarch (SIGACT News, 1996)

Finding the ith largest of n for small i, n. - William I. Gasarch; Wayne Kelly; William W. Pugh (SIGACT News, 1996)

Frequency Computation and Bounded Queries. - Richard Beigel; William I. Gasarch; Efim B. Kinber (Theor. Comput. Sci., 1996)

Team Learning as a Game. - Andris Ambainis; Kalvis Apsitis; Rusins Freivalds; William I. Gasarch; Carl H. Smith (ALT, 1997)

Implementing WS1S via Finite Automata: Performance Issues. - James Glenn; William I. Gasarch (Workshop on Implementing Automata, 1997)

Asking Questions Versus Verifiability. - William I. Gasarch; Mahendran Velauthapillai (Fundam. Informaticae, 1997)

On Bounded Queries and Approximation. - Richard Chang 001; William I. Gasarch; Carsten Lund (SIAM J. Comput., 1997)

Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)). - William I. Gasarch (SIGACT News, 1997)

Binary Search and Recursive Graph Problems. - William I. Gasarch; Katia S. Guimarães (Theor. Comput. Sci., 1997)

Classification Using Information. - William I. Gasarch; Mark G. Pleszkoch; Frank Stephan 001; Mahendran Velauthapillai (Ann. Math. Artif. Intell., 1998)

On the Finiteness of the Recursive Chromatic Number. - William I. Gasarch; Andrew C. Y. Lee (Ann. Pure Appl. Log., 1998)

Reverse Mathematics and Recursive Graph Theory. - William I. Gasarch; Jeffry L. Hirst (Math. Log. Q., 1998)

Addition in log2n + O(1) Steps on Average: A Simple Analysis. - Richard Beigel; William I. Gasarch; Ming Li 001; Louxin Zhang (Theor. Comput. Sci., 1998)

On the Relative Sizes of Learnable Sets. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (Theor. Comput. Sci., 1998)

On Finding the Number of Graph Automorphisms. - Robert Beals; Richard Chang 001; William I. Gasarch; Jacobo Torán (Chic. J. Theor. Comput. Sci., 1999)

Review of Alogrithms and Theory of Computation Handbook: edited by Mikhail Atallah. - William I. Gasarch (SIGACT News, 1999)

Review of Handbook of Combinatorics (in two Volumes): edited by R. L. Graham, M. Grötschel, L. Lovász. - William I. Gasarch (SIGACT News, 1999)

The Book Review Column. - William I. Gasarch; Samir Khuller (SIGACT News, 1999)

Theoretical Computer Science. - William I. Gasarch; Arto Salomaa; Thomas H. Cormen; Lane A. Hemaspaandra; Milena Mihail (Handbook of Discrete and Combinatorial Mathematics, 1999)

A Survey of Constant Time Parallel Sorting. - William I. Gasarch; Evan Golub; Clyde P. Kruskal (Bull. EATCS, 2000)

Some Connections between Bounded Query Classes and Non-Uniform Complexity - Amihood Amir; Richard Beigel; William I. Gasarch (Electron. Colloquium Comput. Complex., 2000)

The Comlexity of OddAn. - Richard Beigel; William I. Gasarch; Martin Kummer; Georgia Martin; Timothy H. McNicholl; Frank Stephan 001 (J. Symb. Log., 2000)

Book review: Indiscrete Thoughts by Gina-Carlo Rota (Birkhauser, 1996). - William I. Gasarch (SIGACT News, 2000)

Reviews of THREE books on Fair Division of Resources. - William I. Gasarch (SIGACT News, 2000)

The Communication Complexity of Enumeration, Elimination, and Selection. - Andris Ambainis; Harry Buhrman; William I. Gasarch; Bala Kalyanasundaram; Leen Torenvliet (J. Comput. Syst. Sci., 2001)

Review of "The CodeBreakers: the story of secrete writing" by David Kahn. Scribner. - William I. Gasarch (SIGACT News, 2001)

Review of Proofs and Refutations: author of book: Imre Lakatos. - William I. Gasarch (SIGACT News, 2001)

Aha! an illuminating perspective. - David Ginat; Daniel D. Garcia; William I. Gasarch (SIGCSE, 2002)

Max and min limiters. - James C. Owings; William I. Gasarch; Georgia Martin (Arch. Math. Log., 2002)

Automata techniques for query inference machines. - William I. Gasarch; Geoffrey R. Hird (Ann. Pure Appl. Log., 2002)

Review of Calculated Bets. - William I. Gasarch (SIGACT News, 2002)

A Nearly Tight Bound for Private Information Retrieval Protocols - Richard Beigel; Lance Fortnow; William I. Gasarch (Electron. Colloquium Comput. Complex., 2003)

Constant time parallel sorting: an empirical view. - William I. Gasarch; Evan Golub; Clyde P. Kruskal (J. Comput. Syst. Sci., 2003)

When does a random Robin Hood win? - William I. Gasarch; Evan Golub; Aravind Srinivasan (Theor. Comput. Sci., 2003)

The communication complexity of the Exact-N Problem revisited. - William I. Gasarch; James Glenn; Andrey Utis (Algebraic Methods in Computational Complexity, 2004)

Finding Isolated Cliques by Queries – An Approach to Fault Diagnosis with Many Faults. - William I. Gasarch; Frank Stephan 001 (Algebraic Methods in Computational Complexity, 2004)

Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (CoRR, 2004)

A Survey on Private Information Retrieval (Column: Computational Complexity). - William I. Gasarch (Bull. EATCS, 2004)

Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (Electron. Colloquium Comput. Complex., 2004)

Review of "Handbook of Graph Theory edited by Gross and Yellen." CRC, 2004. - William I. Gasarch (SIGACT News, 2004)

Review of "Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn"; MAA, 2003. - William I. Gasarch (SIGACT News, 2005)

Review of "Cryptological Mathematics by Robert Lewand"; MAA, 2000, $33.95, Softcover. - William I. Gasarch (SIGACT News, 2005)

The Complexity of Learning SUBSEQ (A). - Stephen A. Fenner; William I. Gasarch (ALT, 2006)

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (ISAAC, 2006)

The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems. - Richard Beigel; William I. Gasarch; James Glenn (MFCS, 2006)

A tight lower bound for restricted pir protocols. - Richard Beigel; Lance Fortnow; William I. Gasarch (Comput. Complex., 2006)

A joint review of "Reality Conditions: Short Mathematical Fiction, by Alex Kasman", MAA 2005;"Numb3rs, TV show. CBS", Free. Currently running Fridays at 10: 00PM; "Mathematical Apocryphia: Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz", MAA, 2002; "Mathematical Apocryphia Redux: More Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz", MAA, 1999. - William I. Gasarch (SIGACT News, 2006)

Review of "The Square Root of 2: A Dialogue Concerning a Number and a Sequence by David Flannery", Copernicus Books, 2006. - William I. Gasarch; Alexander Kruskal; Justin Kruskal; Rebecca Kruskal (SIGACT News, 2006)

Review of "Excellence Without a Soul: How a Great University Forgot Education by Harry Lewis, " Public Affairs, 290 pages. - William I. Gasarch (SIGACT News, 2007)

Joint review of "Three Blogs by theorists: Computational Complexity (weblog.fortnow.com) by Lance Fortnow, Shtetl-Optimized (www.scottaaronson.com/blog/) by Scott Aaronson, In theory (in-theory.blogspot.com) by Luca Trevisan, ". - William I. Gasarch (SIGACT News, 2007)

Review of "A Century of Scientific Publishing: A collection of essays edited by Fredriksson, " IOS press. - William I. Gasarch (SIGACT News, 2007)

Review of "Research Problems in Discrete Geometry by Brass, Moser, Pach, " Springer-Verlag. - William I. Gasarch (SIGACT News, 2007)

Invitation to Fixed-Parameter Algorithms: Parameterized Complexity Theory: Parameterized Algorithmics: Theory, Practice and Prospects. - William I. Gasarch; Keung Ma Kin (Comput. J., 2008)

Memorial issue for Carl Smith. - William I. Gasarch (J. Comput. Syst. Sci., 2008)

Finding large 3-free sets I: The small n case. - William I. Gasarch; James Glenn; Clyde P. Kruskal (J. Comput. Syst. Sci., 2008)

Inferring answers to queries. - William I. Gasarch; Andrew C. Y. Lee (J. Comput. Syst. Sci., 2008)

The complexity of learning SUBSEQ(A). - Stephen A. Fenner; William I. Gasarch; Brian Postow (J. Symb. Log., 2009)

The Complexity of Finding SUBSEQ(A). - Stephen A. Fenner; William I. Gasarch; Brian Postow (Theory Comput. Syst., 2009)

Review of blown to bits: your life, liberty, and happiness after the digital explosion by Hal Abelson, Ken Ledeen, and Harry Lewis (Addison Wesley, 2008). - William I. Gasarch (SIGACT News, 2009)

Review of rock, paper, scissors: game theory for everyday life by Len Fisher (Basic Books, 2008). - William I. Gasarch (SIGACT News, 2009)

Review of the mathematical coloring book: mathematics of coloring and the colorful life of its creators by Alexander Soifer. - William I. Gasarch (SIGACT News, 2009)

Joint review of Professor Stewart's cabinet of mathematical curiosities by Ian Stewart and Five minute mathematics by Ehrhard Behrends and Aha gotcha!-aha insight! by Martin Gardner and Origami, eleusis, and the soma cube by Martin Gardner and Hexaexagons, probability paradoxes, and the tower of Hanoi by Martin Gardner and Group theory in the bedroom and other mathematical diversions by Brian Hayes. - William I. Gasarch (SIGACT News, 2009)

Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions. - Eric Allender; Luke Friedman; William I. Gasarch (Electron. Colloquium Comput. Complex., 2010)

Limits on the Computational Power of Random Strings. - Eric Allender; Luke Friedman; William I. Gasarch (Electron. Colloquium Comput. Complex., 2010)

Logicomix text by Apostolos Doxiadis and Christos Papadimitriou Art by Alecos Papadatos and Annie di Donna, published by Bloomsbury, 2009 314 pages, softcover. comic book! - William I. Gasarch (SIGACT News, 2010)

Riot at the calc exam and other mathematically bent stories by Colin Adams, published by the AMS, 2009 271 pages, softcover and The great debate which is the best number? by Colin Adams VS Thomas Garrity, moderated by Edward Burger, published by the MAA, 2006 and The United States of mathematics presidential debate by Colin Adams VS Thomas Garrity, moderated by Edward Burger, published by the MAA, 2009. - William I. Gasarch (SIGACT News, 2010)

Random curves: journeys of a mathematician by Neal Koblitz published by springer 2008 390 pages. - William I. Gasarch (SIGACT News, 2010)

Games of no chance (1998, edited by Richard Nowakowski) and more games of no chance (2002, edited by Richard Nowakowski) and games of no chance iii (2009, edited by Michael Albert and Richard Nowakowski published by cambridge press). - William I. Gasarch (SIGACT News, 2010)

Mathematical treks: from surreal numbers to magic circles by Ivars Peterson published by the maa, 2002 170 pages. - William I. Gasarch (SIGACT News, 2010)

Review of the P = NP question and Godel's lost letter by Richard J. Lipton Springer, 2010. - William I. Gasarch (SIGACT News, 2010)

Review of the pea and the sun: a mathematical paradox by Leonard Wapner Published by A.K. Peters, 2005. - William I. Gasarch (SIGACT News, 2010)

Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive. - William I. Gasarch; Bernhard Haeupler (Electron. J. Comb., 2011)

An Application of Ramsey's Theorem to Proving Programs Terminate (An Exposition) - William I. Gasarch (CoRR, 2011)

Joint review of the mathemagician and pied piper: a collection in tribute to Martin Gardner. - William I. Gasarch (SIGACT News, 2011)

Review of Dude, can you count?: stories, challenges, and adventures in mathematics by Christian Constanda. - William I. Gasarch (SIGACT News, 2011)

Review of those fascinating numbers by Jean-Marie De Konick. - William I. Gasarch (SIGACT News, 2011)

An NP-Complete Problem in Grid Coloring - William I. Gasarch; Kevin Lawler (CoRR, 2012)

Review of an introduction to the history of algebra solving equations from Mesopotamian Times to the Renaissance by Jacques Sesiano. - William I. Gasarch (SIGACT News, 2012)

Guest Column: the second P =?NP poll. - William I. Gasarch (SIGACT News, 2012)

Review of combinatorial games: tic-tac-toe theory, by Jozsef Beck. - William I. Gasarch (SIGACT News, 2012)

Applications of the Erdős-Rado Canonical Ramsey Theorem to Erdős-Type Problems. - William I. Gasarch; Sam Zbarsky (Electron. Notes Discret. Math., 2013)

Review of boolean function complexity: advances and frontiers by Stasys Jukna. - William I. Gasarch (SIGACT News, 2013)

Joint review of the honor class: Hilbert's problems and their solver by Ben Yandell and: Mathematical developments arising from Hilbert's problems edited by Felix Browder. - William I. Gasarch (SIGACT News, 2013)

Review of algorithmic puzzles by Anany Levitin and Maria Levitin. - William I. Gasarch (SIGACT News, 2013)

A Sane Proof that COLk ࣘ COL3. - William I. Gasarch (CoRR, 2014)

Review of selected papers on fun & games by Donald E. Knuth. - William I. Gasarch (SIGACT News, 2014)

Review of companion to the papers of Donald Knuth by Donald E. Knuth. - William I. Gasarch (SIGACT News, 2014)

Joint reviews of four articles. - William I. Gasarch (SIGACT News, 2014)

Review of people, problems, and proofs by Richard Lipton and Ken Regan. - William I. Gasarch (SIGACT News, 2014)

Review of the Erdös distance problem by Julia Garibaldi, Alex Iosevich and Steven Senger. - William I. Gasarch (SIGACT News, 2014)

The Book Review Column. - William I. Gasarch (SIGACT News, 2014)

Review of The Satisfiability Problem: Algorithms and Analyses by Uwe Schöning and Jacobo Torán. - William I. Gasarch (SIGACT News, 2014)

Classifying Problems into Complexity Classes. - William I. Gasarch (Adv. Comput., 2015)

Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices. - William I. Gasarch (Adv. Comput., 2015)

Which Unbounded Protocol for Envy Free Cake Cutting is Better? - William I. Gasarch (CoRR, 2015)

Distinct Volume Subsets. - David Conlon; Jacob Fox; William I. Gasarch; David G. Harris 001; Douglas Ulrich; Samuel Zbarsky (SIAM J. Discret. Math., 2015)

Review of: A Walk Through Combinatorics by Miklós Bóna. - William I. Gasarch (SIGACT News, 2015)

Review of: The Cult of Pythagoras: Math and Myths by Alberto A. Martinez. - William I. Gasarch (SIGACT News, 2015)

Review of: Infinitesimal How a dangerous mathematical theory shaped the modern world by Amir Alexander. - William I. Gasarch (SIGACT News, 2015)

Review of: Martin Gardner in the Twenty-First Century: Edited by Michael Henle and Brian Hopkins. - William I. Gasarch (SIGACT News, 2015)

Review of: Algorithmic Barriers Falling: P=NP? by Donald E. Knuth and Edgar G. Daylight and The Essential Knuth by Donald E. Knuth and Edgar G. Daylight. - William I. Gasarch (SIGACT News, 2015)

Review of: Love and Math: The Heart of Hidden Reality by Edward Frenkel. - William I. Gasarch (SIGACT News, 2015)

Review of: Structure and Randomness: Pages from Year One of a Mathematical Blog by Terence Tao. - William I. Gasarch (SIGACT News, 2015)

Review of Mathematics Galore: The First Five Years of the St. Marks' Institute of Mathematics by James Tanton. - William I. Gasarch (SIGACT News, 2015)

Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (ACM Trans. Comput. Theory, 2015)

Review of What is College For?: The Public Purpose of Higher Education5 by Ellen Condliffe Lagemann and Harry Lewis. - William I. Gasarch (SIGACT News, 2016)

Review of Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles by Denis Hirschfeldt. - William I. Gasarch (SIGACT News, 2016)

Review of The Scholar and the State: In Search of Van der Waerden by Alexander Soifer. - William I. Gasarch (SIGACT News, 2016)

Review of: The Joy of Factoring by Samuel Wagstaff. - William I. Gasarch (SIGACT News, 2016)

Review of: Asymptopia by Joel Spencer and Laura Florescu. - William I. Gasarch (SIGACT News, 2016)

Review of: Ramsey Theory over the Integers (Second Edition) by Bruce M. Landman and Aaron Robertson. - William I. Gasarch (SIGACT News, 2016)

Open Problems About Grid Coloring and The Complexity of Grid Colorings. - William I. Gasarch (SIGACT News, 2016)

Review of: Turing Computability: Theory and Applications by Robert Soare. - William I. Gasarch (SIGACT News, 2016)

On the sizes of DPDAs, PDAs, LBAs. - Richard Beigel; William I. Gasarch (Theor. Comput. Sci., 2016)

Open Problems Column. - William I. Gasarch (SIGACT News, 2017)

Review of Ramsey Theory for Discrete Structures by Hans Jürgen Prömel. - William I. Gasarch (SIGACT News, 2017)

Open Problems in Computational Topology. - William I. Gasarch; Brittany Terese Fasy; Bei Wang 001 (SIGACT News, 2017)

A Muffin-Theorem Generator. - Guangqi Cui; John P. Dickerson; Naveen Durvasula; William Gasarch; Erik Metz; Jacob Prinz; Naveen Raman 001; Daniel Smolyak; Sung Hyun Yoo (FUN, 2018)

Hilbert's Proof of His Irreducibility Theorem. - Mark B. Villarino; William Gasarch; Kenneth W. Regan (Am. Math. Mon., 2018)

Problems with a Point - Exploring Math and Computer Science - William Gasarch; Clyde P. Kruskal (Problems with a Point, 2019)

Distinct volume subsets via indiscernibles. - William Gasarch; Douglas Ulrich (Arch. Math. Log., 2019)

Guest Column: The Third P=?NP Poll. - William I. Gasarch (SIGACT News, 2019)

Review of Q is for Quantum by Terry Rudolph. - William Gasarch (SIGACT News, 2019)

Review of An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics by Matthew Katz and Jan Reimann. - William Gasarch (SIGACT News, 2019)

Review of Factor Man by Matt Ginsberg. - William Gasarch (SIGACT News, 2019)

Guest Column: The Muffin Problem. - William Gasarch; Scott Huddleston; Erik Metz; Jacob Prinz (SIGACT News, 2019)

Review of What Can Be Computed: A Practical Guide to the Theory of Computation by John MacCormick. - William Gasarch (SIGACT News, 2020)

Review of Essential Discrete Mathematics for Computer Science By Harry Lewis and Rachel Zax. - William Gasarch (SIGACT News, 2020)

Review of Theorems of the 21st Century: Volume I. - William Gasarch (SIGACT News, 2020)

Open Problems Column Edited by William Gasarch This Issue's Column! - William Gasarch (SIGACT News, 2020)

Open Problems Column. - William Gasarch; Aarav Bajaj (SIGACT News, 2020)

An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm. - Zongxia Li; William Gasarch (CoRR, 2021)

Alternative Paradigms of Computation. - William Gasarch; Nathan Hayes; Emily Kaplitz; William Regli (CoRR, 2021)

Hilbert's Tenth Problem for Fixed d and n. - William Gasarch (Bull. EATCS, 2021)

Review of Ideas that Created the Future: Classic Papers of Computer Science Edited by Harry Lewis. - William Gasarch (SIGACT News, 2021)

Review of Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion by Hal Abelson, Ken Ledeen, Harry Lewis, and Wendy Seltzer. - William Gasarch (SIGACT News, 2021)

Hilbert's Tenth Problem: Refinements and Variants. - William Gasarch (SIGACT News, 2021)

Open Problems Column. - William Gasarch; Erik Metz (SIGACT News, 2021)

$( mathbb {Z}, text {succ}, U), ( mathbb {Z}, E, U)$, and Their CSP's. - William Gasarch; Michael C. Laskowski; Shaopeng Zhu (TAMC, 2022)

Review of Tales of Impossibility: The 2000-Year Quest to Solve the Mathematical Problems of Antiquity Author: David Richeson. - William Gasarch (SIGACT News, 2022)

Review of A Map that Reflects the Territory: Essays by the LessWrong Community Author: LessWrong. - William Gasarch (SIGACT News, 2022)

Review of "The Engines of Cognition: Essays by the Less Wrong Community by Less Wrong Less Wrong Press 720 pages, Year: 2019 $30.00". - William Gasarch (SIGACT News, 2022)

The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number. - William Gasarch; Nathan Hayes; Anthony Ostuni; Davin Park (SIGACT News, 2022)

Joint Review of The Mathematics of Various Entertaining Subjects: Research in Recreational Math and The Mathematics of Various Entertaining Subjects: Vol. 2. Research in Games, Graphs, Counting, and Complexity and The Mathematics of Various Entertaining Subjects Vol. 3. The Magic of Mathematics. - William Gasarch (SIGACT News, 2023)

The Complexity of Grid Coloring. - Daniel Apon; William Gasarch; Kevin Lawler (Theory Comput. Syst., 2023)

Fermat's Last Theorem, Schur's Theorem (in Ramsey Theory), and the infinitude of the primes. - William Gasarch (Discret. Math., 2023)