William Gasarch | Academic Influence

William Gasarch's AcademicInfluence.com Rankings

William Gasarch

Computer Science

#1067

World Rank

#1105

Historical Rank

computer-science Degrees

William Gasarch

Mathematics

#1757

World Rank

#2817

Historical Rank

Measure Theory

#2493

World Rank

#2995

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

William Gasarch's Degrees

Bachelors Mathematics University of Chicago

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is William Gasarch Influential?

(Suggest an Edit or Addition)

According to Wikipedia, William Ian Gasarch is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory. He is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics.

(See a Problem?)

William Gasarch's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algorithmic Learning in a Random World (2006) (906)
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) (1997) (583)
A Survey on Private Information Retrieval (2004) (232)
Some connections between bounded query classes and nonuniform complexity (1990) (82)
A Survey on Private Information Retrieval (Column: Computational Complexity) (2004) (75)
Stable Marriage and its Relation to Other Combinatorial Problems : An Introduction to Algorithm Analysis (2002) (73)
Polynomial Terse Sets (1988) (58)
Guest Column: the second P =?NP poll (2012) (54)
Terse, Superterse, and Verbose Sets (1993) (53)
Extremes in the Degrees of Inferability (1994) (50)
Learning via queries (1988) (50)
Learning via queries to an oracle (1989) (39)
On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case (1989) (37)
Some connections between bounded query classes and non-uniform complexity (2003) (34)
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) (2009) (34)
Limits on the computational power of random strings (2011) (33)
Frequency computation and bounded queries (1995) (31)
Bounded queries in recursion theory: a survey (1991) (30)
Bounded Queries in Recursion Theory (1998) (29)
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity (2007) (28)
Training Sequences (1989) (25)
OptP as the Normal Behavior of NP-Complete Problems (1995) (24)
Bounded query classes and the difference hierarchy (1989) (23)
Review of "Handbook of Graph Theory edited by Gross and Yellen." CRC, 2004. (2004) (23)
Finding large 3-free sets I: The small n case (2008) (21)
On bounded queries and approximation (1993) (20)
A Survey of Recursive Combinatorics (2007) (20)
A tight lower bound for restricted pir protocols (2006) (20)
Learning via queries (1988) (20)
Review of "Excellence Without a Soul: How a Great University Forgot Education by Harry Lewis," Public Affairs, 290 pages. (2007) (19)
Learning via queries (1992) (17)
On finding the number of graph automorphisms (1995) (17)
Implementing WS1S via Finite Automata (1996) (17)
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems (2006) (16)
Automata and Languages : Theory and Applications (2015) (15)
The communication complexity of enumeration, elimination, and selection (2000) (14)
Relativizations Comparing NP and Exponential Time (1984) (14)
Rectangle-Free Coloring of Grids (2010) (12)
Review of rock, paper, scissors: game theory for everyday life by Len Fisher (Basic Books, 2008) (2009) (12)
Asking Questions Versus Verifiability (1992) (12)
On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case (1989) (12)
Learning via queries with teams and anomilies (1990) (12)
Degrees of inferability (1992) (12)
Classification using information (1994) (11)
A Nearly Tight Lower Bound for Private Information Retrieval Protocols (2003) (11)
m solutions good, m-1 solutions better (2007) (11)
The complexity of ODDnA (2000) (10)
Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices (2015) (10)
On honest polynomial reductions, relativizations, and P=NP (1989) (9)
The Mapmaker's dilemma (1991) (9)
Nondeterministic Bounded Query Reducibilities (1989) (9)
On the Query Complexity of Sets (1996) (9)
Learning Via Queries in $\lbrack +, < \rbrack$ (1992) (9)
Guest Column: The Third P=?NP Poll (2019) (9)
Distinct Volume Subsets (2014) (9)
Measure, Category and Learning Theory (1995) (8)
Finding the ith largest of n for small i,n (1996) (8)
Classifying Problems into Complexity Classes (2015) (8)
Reverse Mathematics and Recursive Graph Theory (1994) (8)
Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive (2010) (8)
A Nearly Tight Bound for Private Information Retrieval Protocols (2003) (8)
Constant time parallel sorting: an empirical view (2003) (7)
Learning programs with an easy to calculate set of errors (1988) (7)
Nearly tight bounds for private information retrieval systems (2002) (7)
On the Relative Sizes of Learnable Sets (1998) (7)
Oracles for Deterministic versus Alternating Classes (1987) (7)
Computationally Inexpensive cPIR (2007) (7)
Index Sets in Recursive Combinatorics (1993) (7)
Derivation and Computation : taking the Curry-Howard correspondence seriously (2008) (6)
On Checking Versus Evaluation of Multiple Queries (1990) (6)
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (2004) (6)
Inferring answers to queries (1997) (6)
Recursion theoretic models of learning: Some results and intuitions (1995) (6)
Chapter 16 A survey of recursive combinatorics (1998) (6)
Aha! an illuminating perspective (2002) (5)
New Upper and Lower Bounds on the Rado Numbers (2012) (5)
On the Finiteness of the Recursive Chromatic Number (1998) (5)
The Complexity of Finding SUBSEQ(A) (2009) (5)
Implementing WS1S via Finite Automata: Performance Issues (1997) (5)
A Survey of Constant Time Parallel Sorting (2000) (5)
Some Connections between Bounded Query Classes and Non-Uniform Complexity (Long Version) (2000) (5)
Hilbert’s Proof of His Irreducibility Theorem (2016) (5)
Open Problems in Computational Topology (2017) (5)
Review of "Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn"; MAA, 2003 (2005) (4)
Hilbert's Tenth Problem: Refinements and Variants (2021) (4)
An NP-Complete Problem in Grid Coloring (2012) (4)
When does a random Robin Hood win? (2003) (4)
On Selecting the k Largest with Restricted Quadratic Queries (1991) (4)
The complexity of oddan (2000) (4)
Addition in log2n + O(1) Steps on Average: A Simple Analysis (1998) (4)
Empirical studies in parallel sorting (1999) (4)
The Coefficient-Choosing Game (2017) (4)
Theoretical Computer Science (1999) (3)
Square-Difference-Free Sets of Size Omega(n^{0.7334...}) (2008) (3)
Review: Eitan Gurari, An Introduction to the Theory of Computation (1991) (3)
Reductions for learning via queries (1995) (3)
When Can One Load a Set of Dice so that the Sum Is Uniformly Distributed (1999) (3)
Gems in the Field of Bounded Queries (2003) (3)
THE EGG GAME (2006) (3)
Open Problems Column (2017) (2)
On the Number Components of a Recursive Graph (1992) (2)
Team Learning as a Game (1997) (2)
Purely Combinatorial Proofs of Van Der Waerden-Type Theorems Andy Parrish December 17 , 2007 1 (2007) (2)
Applications of the Canonical Ramsey Theorem to Geometry (2013) (2)
Hilbert's Tenth Problem for Fixed d and n (2021) (2)
Definitions and Questions (1999) (2)
NIM with Cash (2012) (2)
Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions (2010) (2)
Which Unbounded Protocol for Envy Free Cake Cutting is Better? (2015) (2)
On the Inference of Sequences of Functions (1986) (2)
Open Problems Column (2017) (1)
A Muffin-Theorem Generator (2018) (1)
M ay 2 00 8 Square-Difference-Free Sets of Size Ω ( n 0 . 7334 · · · ) (2008) (1)
The complexity of learning SUBSEQ(A) (2006) (1)
Review of "The CodeBreakers: the story of secrete writing" by David Kahn. Scribner. (2001) (1)
Automata techniques for query inference machines (2002) (1)
Review of "The Square Root of 2: A Dialogue Concerning a Number and a Sequence by David Flannery", Copernicus Books, 2006. (2006) (1)
Three Proofs of the Hypergraph Ramsey Theorem (An exposition) (2012) (1)
The Complexity of Problems (1996) (1)
Mathematical Muffin Morsels (2020) (1)
Binary Search and Recursive Graph Problems (1997) (1)
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems (2006) (1)
Open Problems Column (2017) (1)
The Complexity of Grid Coloring (2022) (1)
BOOK REVIEW: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. $39.50.) (1994) (1)
Learning via queries in $\lbrack +, (1992) (1)
Review of The Satisfiability Problem: Algorithms and Analyses by Uwe Schöning and Jacobo Torán (2014) (1)
Models and Computability: A Techniques Oriented Survey of Bounded Queries (1999) (1)
Invitation to Fixed-Parameter Algorithms: Parameterized Complexity Theory: Parameterized Algorithmics: Theory, Practice and Prospects (2007) (1)
Review of Proofs and Refutations: author of book: Imre Lakatos (2001) (1)
The Structure of the Honest Polynomial m-Degrees (1994) (1)
Review of "Research Problems in Discrete Geometry by Brass, Moser, Pach, " Springer-Verlag (2007) (1)
Review of: Ramsey Theory over the Integers (Second Edition) by Bruce M. Landman and Aaron Robertson (2016) (1)
Review of algorithmic puzzles by Anany Levitin and Maria Levitin (2013) (1)
A Survey of Lower Bound on the van Der Waerden Number $W(k,2)$ (2010) (1)
Ramsey ’ s Theorem on Graphs (2015) (1)
Efficient Secure Two-Party Protocols : Techniques and Constructions by Carmit (2013) (1)
On the sizes of DPDAs, PDAs, LBAs (2015) (1)
Joint review of the mathemagician and pied piper: a collection in tribute to Martin Gardner (2011) (0)
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! (2010) (0)
Review of the P = NP question and Godel's lost letter by Richard J. Lipton Springer, 2010 (2010) (0)
Session details: Regular features (2013) (0)
An Exposition applying 2-player Communication Complexity to get Lower Bounds on Branching Program (2008) (0)
Review of: A Walk Through Combinatorics by Miklós Bóna (2015) (0)
The book review column (2010) (0)
The book review column (2006) (0)
The Complexity of ODD n A and MOD m n A (1999) (0)
Classical and Quantum Computing with C + + and Java Simulations by Yorick (2005) (0)
The Book Review Column (1998) (0)
$(\mathbb {Z}, \text {succ}, U), (\mathbb {Z}, E, U)$, and Their CSP's (2022) (0)
Algorithms for Calculating Statistical Properties of Moving Points (2009) (0)
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults (2004) (0)
NIM with Cash: A Concrete Approach (2019) (0)
Hilbert's Tenth Problem (2021) (0)
Open Problems Column (2020) (0)
BACK MATTER (2018) (0)
Review of "Cryptological Mathematics by Robert Lewand"; MAA, 2000, $33.95, Softcover. (2005) (0)
Is There a Pattern? Is it Interesting? Perfect Numbers and Sums of Cubes (2019) (0)
Open Problems Column (2019) (0)
The book review column (1999) (0)
The book review column (2007) (0)
4 Kolmogorov Complexity (2017) (0)
The Book Review Column (2014) (0)
Review of the mathematical coloring book: mathematics of coloring and the colorful life of its creators by Alexander Soifer (2009) (0)
Review of Alogrithms and Theory of Computation Handbook: edited by Mikhail Atallah (1999) (0)
A High School Math Competition Problem Inspires an Infinite Number of Proofs (2018) (0)
A Sane Reduction of COL4 to COL3 (2019) (0)
Review of Ideas that Created the Future (2021) (0)
Fermat's Last Theorem, Schur's Theorem (in Ramsey Theory), and the infinitude of the primes (2023) (0)
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 (2013) (0)
The book review column (2008) (0)
Multiparty Communication Complexity: A Fun Approach (2019) (0)
What is an Elegant Proof? A Theorem About Digits (2019) (0)
Fermat’s Last Theorem, Schur’s Theorem (in Ramsey Theory), and the Inﬁnitude of the Primes (2022) (0)
The book review column (2012) (0)
Review of selected papers on fun & games by Donald E. Knuth (2014) (0)
Three Results on Making Change (An Exposition) (2015) (0)
Review of "The Engines of Cognition: Essays by the Less Wrong Community by Less Wrong Less Wrong Press 720 pages, Year: 2019 $30.00" (2022) (0)
Review of Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles by Denis Hirschfeldt (2016) (0)
Small NFA’s for Cofinite Unary Languages (2018) (0)
The book review column (2010) (0)
The book review column (2013) (0)
The Book Review Column (2000) (0)
The Book Review Column Algorithms for It That Work in Theory, Algorithms for It That Work in Practice, and Lower Bounds. 2 Books I Need Reviewed for Sigact News Column Algorithms (2014) (0)
The Book Review Column (1999) (0)
Unbounded Search and Recursive Graph Problems (1995) (0)
The Book Review Column 1 Part Ii: Decidable Classes and Their Complexity (2004) (0)
The Complexity of C n A (1999) (0)
The book review column (2011) (0)
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," reviewed by Bill Gasarch (2007) (0)
Guest Column: The Muffin Problem (2019) (0)
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 Apocryp (2006) (0)
Refined Upper and Lower Bounds for 2-SUM (2004) (0)
Review of Handbook of Combinatorics (in two Volumes): edited by R. L. Graham, M. Grötschel, L. Lovász (1999) (0)
Review of Essential Discrete Mathematics for Computer Science By Harry Lewis and Rachel Zax (2020) (0)
The book review column (2006) (0)
The book review column (2009) (0)
Session details: The book review column (2008) (0)
Separating and Collapsing Classes (1999) (0)
A Sane Proof that COLk ࣘ COL3 (2014) (0)
The Book Review Column (2015) (0)
Review of Mathematics Galore (2015) (0)
Review of Blown to Bits (2021) (0)
The Book Review Column (1999) (0)
Alternative Modes of Computation (2020) (0)
The book review column (2001) (0)
Review of What Can Be Computed (2020) (0)
Selected challenges in computational lower bounds (2017) (0)
Timing is Everything! Every Planar Graph is 4.5-Colorable (2018) (0)
The book review column (2012) (0)
The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number (2022) (0)
Open Problems Column Edited by William Gasarch This Issue's Column! (2021) (0)
Maximizing Winnings on Final Jeopardy ! (2017) (0)
Review of: Infinitesimal How a dangerous mathematical theory shaped the modern world by Amir Alexander (2015) (0)
The book review column (2011) (0)
An Application of Ramsey Theory to in Multiparty Communication Complexity Exposition (2018) (0)
Review of: Love and Math: The Heart of Hidden Reality by Edward Frenkel (2015) (0)
Making change for n cents: Two approaches (2014) (0)
Review of boolean function complexity: advances and frontiers by Stasys Jukna (2013) (0)
Open Problems About Grid Coloring and The Complexity of Grid Colorings (2016) (0)
Review of the pea and the sun: a mathematical paradox by Leonard Wapner Published by A.K. Peters, 2005 (2010) (0)
What is a Simple Function? (2019) (0)
How Do Mathematical Objects Get Named? (2019) (0)
A Survey of Constant Time Parallel Sorting ( Preliminary Version ) (2007) (0)
Open Problems Column (2019) (0)
Model theory and complexity theory (2007) (0)
Open Problems Column (2018) (0)
Review of A Map that Reflects the Territory (2022) (0)
Lets Prove Something Instead of Proving That We Can’t Prove Something!!! (2018) (0)
The book review column (2006) (0)
The book review column (2014) (0)
An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm (2021) (0)
nA and Other Functions (1999) (0)
The Comlexity of OddAn (2000) (0)
The book review column (2008) (0)
Large Subsets of Points with all Pairs ( Triples ) Having Different Distances ( Areas ) (2013) (0)
Ramsey Theory and History: An Example of Interdisciplinary Research (2018) (0)
Review of What is College For?: The Public Purpose of Higher Education5 by Ellen Condliffe Lagemann and Harry Lewis (2016) (0)
The book review column (2013) (0)
Review of Tales of Impossibility (2022) (0)
Open Problems Column (2022) (0)
The book review column (2007) (0)
Max and min limiters (2002) (0)
Memorial issue for Carl Smith (2008) (0)
Ramsey Theorm and the History of Pre-Chrisitan England (2022) (0)
A Complete High School Proof of Schur's Theorem on Making Change of $n$ cents (2015) (0)
Mathematical treks: from surreal numbers to magic circles by Ivars Peterson published by the maa, 2002 170 pages (2010) (0)
The Comlexity of Odd A n . (2000) (0)
A Hat Problem, its Generalizations, and a Story! (2019) (0)
The book review column (2002) (0)
Van Der Waerden's Theorem: Exposition and Generalizations (2007) (0)
Is This Problem Interesting? (2019) (0)
The book review column (2010) (0)
Review of Calculated Bets (2002) (0)
Complexity Theory Newsflash (1996) (0)
Review of The Scholar and the State: In Search of Van der Waerden by Alexander Soifer (2016) (0)
BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms (2015) (0)
The book review column (2011) (0)
J. Longley The sequentially realizable functionals 1 ZM Ariola and S. Blom Skew confluence and the lambda calculus with letrec 95 (2002) (0)
The Book Review Column (1998) (0)
Ramsey Theory and History: An Example of Interdisciplinary Research — An Alternative View (2019) (0)
Review of: Asymptopia by Joel Spencer and Laura Florescu (2016) (0)
Open Problems Column (2021) (0)
The Book Review Column 1 Books on Cryptography and Books on Learning Books on Complexity and Logic (0)
A Higher Dimensional Version of a Problem of Erdős (2013) (0)
Gathering for Gardner Recreational vs. Serious Mathematics (2019) (0)
Open Problems Column (2020) (0)
Funny Answers to Math Questions (2018) (0)
Open Problems Column (2020) (0)
The book review column (2010) (0)
A Statement in Combinatorics that is Independent of ZFC (an exposition) (2012) (0)
Networked Life : 20 questions and answers by Mung Chiang 4 (2013) (0)
Applications of the Erdős-Rado Canonical Ramsey Theorem to Erdős-Type Problems (2013) (0)
Joint Review of The Mathematics of Various Entertaining Subjects (2023) (0)
Joint reviews of four articles (2014) (0)
Open problems column (2022) (0)
The book review column (2003) (0)
The Number of ways to Make Change is Almost a Polynomial (2015) (0)
The book review column (2002) (0)
An Application of Ramsey's Theorem to Proving Programs Terminate (An Exposition) (2011) (0)
The book review column (2010) (0)
Ramsey Theorem and the History of Pre-Christian England (2022) (0)
Review of Theorems of the 21st Century (2020) (0)
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) (2010) (0)
7. Chases and Escapes by Paul J. Nahin. Review by Eowyn Čenek. You are the captain of a merchant ship. Pirates are in pursuit! You are going in a straight line and the pirate (2009) (0)
Review of combinatorial games: tic-tac-toe theory, by Jozsef Beck (2012) (0)
The communication complexity of the Exact-N Problem revisited (2004) (0)
The Book Review Column (2000) (0)
Mathematics and prejudice (2014) (0)
Review of: Turing Computability: Theory and Applications by Robert Soare (2016) (0)
The book review column (2007) (0)
An Exposition of a problem in Multiparty Communication Complexity and its Application to Lower Bounds on Branching Program (2008) (0)
The book review column (2012) (0)
Review of those fascinating numbers by Jean-Marie De Konick (2011) (0)
Open Problems Column (2019) (0)
Low, Superlow, and Superduperlow Sets: An Exposition of a Known But Not Well-Known Result (2015) (0)
Proving programs terminate using well orderings, Ramsey Theory, and Matrices (2011) (0)
Trick Question or Stupid Question? (2018) (0)
Book review. Indiscrete thoughts. G-C Rota (1999) (0)
Finding Large Sets Without Arithmetic Progressions of Length Three (2010) (0)
The book review column (2012) (0)
Distinct Volume Subsets | SIAM Journal on Discrete Mathematics | Vol. 29, No. 1 | Society for Industrial and Applied Mathematics (2015) (0)
Open Problems Column (2018) (0)
Review of An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics by Matthew Katz and Jan Reimann (2019) (0)
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 (2015) (0)
Session details: Regular features (2013) (0)
The Book Review Column 1 Books That Need Reviewed for the Sigact News Column Algorithms (2015) (0)
Big Ramsey Degrees of Countable Ordinals (2023) (0)
Review of people, problems, and proofs by Richard Lipton and Ken Regan (2014) (0)
Some Open Problems regarding Lower Bounds for Np (2016) (0)
The Book Review Column (1998) (0)
Session details: Regular features: The book review column (2014) (0)
What is Obvious? Less Elegant Proofs That (2nn) and Cn=1n+1(2nn) are Integers (2019) (0)
The Book Review Column Review of Mathematical Support for Molecular Biology (2002) (0)
Algorithms and Data Structures 1. Algorithmic Design: Foundations, Analysis, and Internet Examples by Goodrich and Tamassia. 2. Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms by Hromkovic. 3. Combinatorial Optimization: Packing and Covering by Cornuejols. 4. An Introd (2006) (0)
Review of "A Century of Scientific Publishing: A collection of essays edited by Fredriksson," IOS press (2007) (0)
The book review column (2003) (0)
Review of an introduction to the history of algebra solving equations from Mesopotamian Times to the Renaissance by Jacques Sesiano (2012) (0)
The book review column (2005) (0)
Review of: Martin Gardner in the Twenty-First Century: Edited by Michael Henle and Brian Hopkins (2015) (0)
If That Were True I Would Know It! A Result in Kolmogorov Complexity (2019) (0)
The book review column (2009) (0)
The Muffin Problem (2017) (0)
When Terms from Math are Used by Civilians… (2019) (0)
A Survey of Inductive Inference with an Emphasis on Queries (2019) (0)
Random curves: journeys of a mathematician by Neal Koblitz published by springer 2008 390 pages (2010) (0)
The book review column (2002) (0)
The Book Review Column (1998) (0)
The Book Review Column 1 Books I Need Reviewed for Sigact News Column Algorithms and Combinatorics 1. Integrated Methods for Optimization (second Edition) (2012) (0)
The Book Review Column 1 Books on Cryptography and Coding Theory (2010) (0)
Review of: The Joy of Factoring by Samuel Wagstaff (2016) (0)
$\sum_{p\le n} 1/p = \ln(\ln n) + O(1)$: An Exposition (2015) (0)
C O ] 3 0 A pr 2 00 8 Square-Difference-Free Sets of Size Ω ( n 0 . 7167 − ǫ ) (2008) (0)
Pseudorandom Sources and Oracles for BPP (2008) (0)
The Book Review Column (2000) (0)
Problems with a Point (2018) (0)
The book review column (2005) (0)
Review of: The Cult of Pythagoras: Math and Myths by Alberto A. Martinez (2015) (0)
The book review column (2004) (0)
The book review column (2004) (0)
A Sane Proof that COLk \le COL3 (2014) (0)
The book review column (2006) (0)
The book review column (2004) (0)
Review of companion to the papers of Donald Knuth by Donald E. Knuth (2014) (0)
The book review column (2001) (0)
Open Problems Column (2018) (0)
The book review column (2011) (0)
Selection problems viaM-ary queries (1990) (0)
Distinct volume subsets via indiscernibles (2018) (0)
Open Problems Column (2021) (0)
The Book Review Column (1999) (0)
Sports Violate the Rules of Mathematics! (2019) (0)
Joint Review of ( a ) The Honor Class : Hilbert ’ s Problems and Their Solver by Ben Yandell . ( b ) Mathematical Developments arising from Hilbert ’ s Problems (2014) (0)
2 of Combinatorial Optimization : Packing and Covering (2008) (0)
Network Design : Connectivity and Facilities Location (2022) (0)
Reviews of THREE books on Fair Division of Resources (2000) (0)
The Literature on Bounded Queries (1999) (0)
The book review column (2014) (0)
How many ways can you make change: Some easy proofs (2014) (0)
The Book Review Column 1 (1998) (0)
The Book Review Column (2000) (0)
The book review column (2009) (0)
Ramsey ’ s Theorem on Graphs Exposition (2012) (0)
The book review column (2005) (0)
Review of: Structure and Randomness: Pages from Year One of a Mathematical Blog by Terence Tao (2015) (0)
Review of Ramsey Theory for Discrete Structures by Hans Jürgen Prömel (2017) (0)
Alternative Paradigms of Computation (2021) (0)
Multiparty Communication Complexity : The Ramsey Theory We Will Need Exposition by William Gasarch 1 Recall (2008) (0)
Q Versus QC (1999) (0)
RAMSEY GAME NUMBERS (0)
Dispelling the Myth That the Early Logicians Were a Few Axioms Short of a Complete Set (2019) (0)
Open Problems Column (2019) (0)
Review of Dude, can you count?: stories, challenges, and adventures in mathematics by Christian Constanda (2011) (0)
Is This Problem Too Hard for a High School Math Competition? (2018) (0)
The book review column (2008) (0)
FRONT MATTER (2018) (0)
Ju l 2 01 8 Distinct Volume Subsets via Indiscernibles (2018) (0)
The Book Review Column 4. Analysis of Algorithms:an Active Learning Approach 5 Further Reading 6 Opinion (2002) (0)
Open Problems Column (2018) (0)
The Computational Complexity Column by Lance Fortnow (2004) (0)
Open Problems Column (2022) (0)
Investigating Optimal Choice of Adversary in Deep Q Learning Using Nim With Cash (2022) (0)
Learning vi Queries in [+, <] (1992) (0)
Book review: Indiscrete Thoughts by Gina-Carlo Rota (Birkhauser, 1996) (2000) (0)
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna (2004) (0)
The book review column (2003) (0)
Review of Factor Man by Matt Ginsberg (2019) (0)
Ramsey Theory on Ordered Graphs (2023) (0)
The book review column (2002) (0)
The Book Review Column (1997) (0)
Review of the erdös distance problem by Julia Garibaldi, Alex Iosevich and Steven Senger (2014) (0)
Distinct volume subsets via indiscernibles (2018) (0)
Bounded Queries and the Halting Set (1999) (0)
The book review column (2003) (0)
The book review column (2001) (0)
The Complexity of ODD An Richard Beigel (2007) (0)
Making change for n cents (2014) (0)
What is an Elegant Proof? Some Coloring Theorems (2019) (0)

This paper list is powered by the following services:

Other Resources About William Gasarch

en.wikipedia.org

What Schools Are Affiliated With William Gasarch?

William Gasarch is affiliated with the following schools: