William I. Gasarch

Eric Allender, Luke Friedman, William I. Gasarch: Limits on the computational power of random strings. Inf. Comput. 222: 80-92 (2013)

William I. Gasarch: The book review column. SIGACT News 44(1): 7-9 (2013)

William I. Gasarch: The book review column. SIGACT News 43(1): 7-9 (2012)

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

William I. Gasarch: The book review column. SIGACT News 43(2): 6-8 (2012)

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

William I. Gasarch: The book review column. SIGACT News 43(3): 15-18 (2012)

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

William I. Gasarch: The book review column. SIGACT News 43(4): 10-12 (2012)

William I. Gasarch, Kevin Lawler: An NP-Complete Problem in Grid Coloring. CoRR abs/1205.3813 (2012)

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

William I. Gasarch: The book review column. SIGACT News 42(1): 12-15 (2011)

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

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

William I. Gasarch: The book review column. SIGACT News 42(2): 7-10 (2011)

William I. Gasarch: Review of those fascinating numbers by Jean-Marie De Konick. SIGACT News 42(2): 24-27 (2011)

William I. Gasarch: The book review column. SIGACT News 42(3): 14-15 (2011)

William I. Gasarch: The book review column. SIGACT News 42(4): 15-16 (2011)

Eric Allender, Luke Friedman, William I. Gasarch: Limits on the Computational Power of Random Strings. ICALP (1) 2011: 293-304

William I. Gasarch: An Application of Ramsey's Theorem to Proving Programs Terminate (An Exposition). CoRR abs/1108.3347 (2011)

William I. Gasarch: The book review column. SIGACT News 41(1): 10 (2010)

William I. Gasarch: The book review column. SIGACT News 41(2): 7-10 (2010)

William I. Gasarch: 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! SIGACT News 41(2): 26-28 (2010)

William I. Gasarch: 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. SIGACT News 41(2): 50-51 (2010)

William I. Gasarch: The book review column. SIGACT News 41(3): 15-17 (2010)

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

William I. Gasarch: 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). SIGACT News 41(3): 26-28 (2010)

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

William I. Gasarch: The book review column. SIGACT News 41(4): 12-15 (2010)

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

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

Eric Allender, Luke Friedman, William I. Gasarch: Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions. Electronic Colloquium on Computational Complexity (ECCC) 17: 138 (2010)

Eric Allender, Luke Friedman, William I. Gasarch: Limits on the Computational Power of Random Strings. Electronic Colloquium on Computational Complexity (ECCC) 17: 139 (2010)

Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). J. Symb. Log. 74(3): 939-975 (2009)

Stephen A. Fenner, William I. Gasarch, Brian Postow: The Complexity of Finding SUBSEQ(A). Theory Comput. Syst. 45(3): 577-612 (2009)

William I. Gasarch: The book review column. SIGACT News 40(1): 8-10 (2009)

William I. Gasarch: 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). SIGACT News 40(1): 10-13 (2009)

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

William I. Gasarch: The book review column. SIGACT News 40(2): 10-13 (2009)

William I. Gasarch: The book review column. SIGACT News 40(3): 21-24 (2009)

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

William I. Gasarch: 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. SIGACT News 40(3): 32-37 (2009)

William I. Gasarch: The book review column. SIGACT News 40(4): 8-10 (2009)

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

William I. Gasarch: Memorial issue for Carl Smith. J. Comput. Syst. Sci. 74(4): 408 (2008)

William I. Gasarch, Andrew C. Y. Lee: Inferring answers to queries. J. Comput. Syst. Sci. 74(4): 490-512 (2008)

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

William I. Gasarch: The book review column. SIGACT News 39(1): 9-12 (2008)

William I. Gasarch: The book review column. SIGACT News 39(2): 29-31 (2008)

William I. Gasarch: The book review column. SIGACT News 39(4): 15-17 (2008)

Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). Electronic Colloquium on Computational Complexity (ECCC) 15(053) (2008)

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

William I. Gasarch: The book review column. SIGACT News 38(2): 8-10 (2007)

William I. Gasarch: 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, ". SIGACT News 38(2): 23-25 (2007)

William I. Gasarch: The book review column. SIGACT News 38(3): 14-16 (2007)

William I. Gasarch: The book review column. SIGACT News 38(4): 16-18 (2007)

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

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

Richard Beigel, Lance Fortnow, William I. Gasarch: A tight lower bound for restricted pir protocols. Computational Complexity 15(1): 82-91 (2006)

William I. Gasarch: The book review column. SIGACT News 37(1): 9-11 (2006)

William I. Gasarch: The book review column. SIGACT News 37(2): 10-12 (2006)

William I. Gasarch: The book review column. SIGACT News 37(3): 14-17 (2006)

William I. Gasarch: 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. SIGACT News 37(3): 17-19 (2006)

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

William I. Gasarch: The book review column. SIGACT News 37(4): 27-29 (2006)

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

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

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

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

William I. Gasarch: The book review column. SIGACT News 36(2): 3-4 (2005)

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

William I. Gasarch: The book review column. SIGACT News 36(3): 4-5 (2005)

William I. Gasarch: The book review column. SIGACT News 36(4): 4-5 (2005)

William I. Gasarch: A Survey on Private Information Retrieval (Column: Computational Complexity). Bulletin of the EATCS 82: 72-107 (2004)

William I. Gasarch: The book review column. SIGACT News 35(1): 3-4 (2004)

William I. Gasarch: The book review column. SIGACT News 35(2): 3-4 (2004)

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

William I. Gasarch: The book review column. SIGACT News 35(4): 4-5 (2004)

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

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

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis: Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance. CoRR cs.CC/0411076 (2004)

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis: Lower bounds on the Deterministic and Quantum Communication Complexity of HAM_n^a. Electronic Colloquium on Computational Complexity (ECCC)(120) (2004)

Amihood Amir, Richard Beigel, William I. Gasarch: Some connections between bounded query classes and non-uniform complexity. Inf. Comput. 186(1): 104-139 (2003)

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

William I. Gasarch: The book review column. SIGACT News 34(1): 3 (2003)

William I. Gasarch: The book review column. SIGACT News 34(2): 2 (2003)

William I. Gasarch: The book review column. SIGACT News 34(3): 3-4 (2003)

William I. Gasarch: The book review column. SIGACT News 34(4): 14-15 (2003)

William I. Gasarch, Evan Golub, Aravind Srinivasan: When does a random Robin Hood win? Theor. Comput. Sci. 1-3(304): 477-484 (2003)

Richard Beigel, Lance Fortnow, William I. Gasarch: A Nearly Tight Bound for Private Information Retrieval Protocols. Electronic Colloquium on Computational Complexity (ECCC)(087) (2003)

James C. Owings, William I. Gasarch, Georgia Martin: Max and min limiters. Arch. Math. Log. 41(5): 483-495 (2002)

William I. Gasarch, Geoffrey R. Hird: Automata techniques for query inference machines. Ann. Pure Appl. Logic 117(1-3): 169-201 (2002)

William I. Gasarch: The book review column. SIGACT News 33(1): 3-20 (2002)

William I. Gasarch: The book review column. SIGACT News 33(2): 2-9 (2002)

William I. Gasarch: Review of Calculated Bets. SIGACT News 33(2): 19-20 (2002)

William I. Gasarch: The book review column. SIGACT News 33(3): 6 (2002)

William I. Gasarch: The book review column. SIGACT News 33(4): 4-5 (2002)

David Ginat, Daniel D. Garcia, William I. Gasarch: Aha! an illuminating perspective. SIGCSE 2002: 1-2

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

William I. Gasarch: The book review column. SIGACT News 32(1): 2-3 (2001)

William I. Gasarch: The book review column. SIGACT News 32(2): 3-4 (2001)

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

William I. Gasarch: The book review column. SIGACT News 32(4): 2-5 (2001)

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

Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection. Electronic Colloquium on Computational Complexity (ECCC) 8(19) (2001)

William I. Gasarch, Evan Golub, Clyde P. Kruskal: A Survey of Constant Time Parallel Sorting. Bulletin of the EATCS 72: 84-102 (2000)

Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan: The Comlexity of Odd^A_n. J. Symb. Log. 65(1): 1-18 (2000)

William I. Gasarch: The Book Review Column. SIGACT News 31(1): 2-3 (2000)

William I. Gasarch: The Book Review Column. SIGACT News 31(2): 2 (2000)

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

William I. Gasarch: The Book Review Column. SIGACT News 31(3): 10 (2000)

William I. Gasarch: The Book Review Column. SIGACT News 31(4): 3-4 (2000)

William I. Gasarch: Reviews of THREE books on Fair Division of Resources. SIGACT News 31(4): 4-10 (2000)

Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection. IEEE Conference on Computational Complexity 2000: 44-53

Amihood Amir, Richard Beigel, William I. Gasarch: Some Connections between Bounded Query Classes and Non-Uniform Complexity. Electronic Colloquium on Computational Complexity (ECCC) 7(24) (2000)

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

William I. Gasarch: The Book Review Column. SIGACT News 30(1): 2 (1999)

William I. Gasarch: The book review column. SIGACT News 30(2): 2 (1999)

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

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

William I. Gasarch, Samir Khuller: The Book Review Column. SIGACT News 30(3): 8 (1999)

William I. Gasarch: The Book Review Column. SIGACT News 30(4): 3 (1999)

William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai: Classification Using Information. Ann. Math. Artif. Intell. 23(1-2): 147-168 (1998)

William I. Gasarch, Andrew C. Y. Lee: On the Finiteness of the Recursive Chromatic Number. Ann. Pure Appl. Logic 93(1-3): 73-81 (1998)

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

William I. Gasarch: The Book Review Column. SIGACT News 29(1): 2 (1998)

William I. Gasarch: The Book Review Column. SIGACT News 29(2): 17 (1998)

William I. Gasarch: The Book Review Column. SIGACT News 29(3): 43 (1998)

William I. Gasarch: The Book Review Column. SIGACT News 29(4): 2-4 (1998)

Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang: Addition in log₂n + O(1) Steps on Average: A Simple Analysis. Theor. Comput. Sci. 191(1-2): 245-248 (1998)

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

William I. Gasarch, Mahendran Velauthapillai: Asking Questions Versus Verifiability. Fundam. Inform. 30(1): 1-9 (1997)

Richard Chang, William I. Gasarch, Carsten Lund: On Bounded Queries and Approximation. SIAM J. Comput. 26(1): 188-209 (1997)

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

William I. Gasarch: The Book Review Column. SIGACT News 28(4): 16 (1997)

William I. Gasarch, Katia S. Guimarães: Binary Search and Recursive Graph Problems. Theor. Comput. Sci. 181(1): 119-139 (1997)

Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith: Team Learning as a Game. ALT 1997: 2-17

William I. Gasarch, Andrew C. Y. Lee: Inferring Answers to Queries. COLT 1997: 275-284

James Glenn, William I. Gasarch: Implementing WS1S via Finite Automata: Performance Issues. Workshop on Implementing Automata 1997: 75-86

William I. Gasarch: The Complexity of Problems. Advances in Computers 43: 215-241 (1996)

William I. Gasarch, Wayne Kelly, William Pugh: Finding the ith largest of n for small i, n. SIGACT News 27(2): 88-96 (1996)

Stephen A. Fenner, Lance Fortnow, William I. Gasarch: Complexity Theory Newsflash. SIGACT News 27(3): 126 (1996)

Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries. Theor. Comput. Sci. 163(1&2): 177-192 (1996)

Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan: On the Query Complexity of Sets. MFCS 1996: 206-217

James Glenn, William I. Gasarch: Implementing WS1S via Finite Automata. Workshop on Implementing Automata 1996: 50-63

Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang: Addition in log₂n + O(1) Steps on Average: A Simple Analysis. Electronic Colloquium on Computational Complexity (ECCC) 3(51) (1996)

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

William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann: Learning via Queries with Teams and Anomalies. Fundam. Inform. 23(1): 67-89 (1995)

William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport: OptP as the Normal Behavior of NP-Complete Problems. Mathematical Systems Theory 28(6): 487-514 (1995)

Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries. Structure in Complexity Theory Conference 1995: 125-132

Richard Chang, William I. Gasarch, Jacobo Torán: On Finding the Number of Graph Automorphisms. Structure in Complexity Theory Conference 1995: 288-298

William I. Gasarch, Geoffrey R. Hird: Reductions for Learning via Queries. COLT 1995: 152-161

William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai: Classification Using Information. GOSLER Final Report 1995: 162-173

Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan: Measure, Category and Learning Theory. ICALP 1995: 558-569

William I. Gasarch, Katia S. Guimarães: Unbounded Search and Recursive Graph Problems. LATIN 1995: 323-331

Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries. Electronic Colloquium on Computational Complexity (ECCC) 2(36) (1995)

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

Rodney G. Downey, William I. Gasarch, Michael Moses: The Structure of the Honest Polynomial m-Degrees. Ann. Pure Appl. Logic 70(2): 113-139 (1994)

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

William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai: Classification Using Information. AII/ALT 1994: 290-300

Richard Beigel, William I. Gasarch, John Gill, James C. Owings: Terse, Superterse, and Verbose Sets. Inf. Comput. 103(1): 68-85 (1993)

William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene: On Checking Versus Evaluation of Multiple Queries. Inf. Comput. 105(1): 72-93 (1993)

Richard Chang, William I. Gasarch: On Bounded Queries and Approximation. FOCS 1993: 547-556

Katia S. Guimarães, William I. Gasarch, James M. Purtilo: Selection Problems via M-Ary Queries. Computational Complexity 2: 256-276 (1992)

William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning programs with an easy to calculate set of errors. Fundam. Inform. 16(3-4): 355-370 (1992)

William I. Gasarch, Carl H. Smith: Learning via Queries. J. ACM 39(3): 649-674 (1992)

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

William I. Gasarch, Mahendran Velauthapillai: Asking Questions Versus Verifiability. AII 1992: 197-213

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

William I. Gasarch, Katia S. Guimarães: On the Number Components of a Recursive Graph. LATIN 1992: 177-190

Richard Beigel, William I. Gasarch: The Mapmaker's dilemma. Discrete Applied Mathematics 34(1-3): 37-48 (1991)

William I. Gasarch: On Selecting the k Largest with Restricted Quadratic Queries. Inf. Process. Lett. 38(4): 193-195 (1991)

William I. Gasarch: Bounded Queries in Recursion Theory: A Survey. Structure in Complexity Theory Conference 1991: 62-78

Amihood Amir, Richard Beigel, William I. Gasarch: Some Connections Between Bounded Query Classes and Non-Uniform Complexity. Structure in Complexity Theory Conference 1990: 232-243

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

William I. Gasarch, Mark G. Pleszkoch, Robert Solovay: Learning Via Queries in [+, <]. COLT 1990: 338-351

William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene: On Checking Versus Evaluation of Multiple Queries. MFCS 1990: 261-268

Richard Beigel, William I. Gasarch, James C. Owings: Nondeterministic Bounded Query Reducibilities. Ann. Pure Appl. Logic 41(2): 107-118 (1989)

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

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

Dana Angluin, William I. Gasarch, Carl H. Smith: Training Sequences. Theor. Comput. Sci. 66(3): 255-272 (1989)

William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs With an Easy to Calculate Set of Errors. AII 1989: 124-137

Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses: On Honest Polynomial Reductions, Relativizations, and P=NP. Structure in Complexity Theory Conference 1989: 196-207

William I. Gasarch, Mark G. Pleszkoch: Learning via Queries to an Oracle. COLT 1989: 214-229

Amihood Amir, William I. Gasarch: Polynomial Terse Sets. Inf. Comput. 77(1): 37-56 (1988)

William I. Gasarch, Carl H. Smith: Learning via Queries. COLT 1988: 227-241

William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs with an Easy to Calculate Set of Errors. COLT 1988: 242-250

William I. Gasarch, Carl H. Smith: Learning via Queries. FOCS 1988: 130-137

William I. Gasarch: Oracles for Deterministic versus Alternating Classes. SIAM J. Comput. 16(4): 613-627 (1987)

Amihood Amir, William I. Gasarch: Polynomial terse sets. Structure in Complexity Theory Conference 1987

William I. Gasarch, Carl H. Smith: On the Inference of Sequences of Functions. AII 1986: 23-41

William I. Gasarch, Steven Homer: Relativizations Comparing NP and Exponential Time. Information and Control 58(1-3): 88-100 (1983)