Follow
William Gasarch
William Gasarch
Professor of Computer science, University of Maryland
Verified email at cs.umd.edu - Homepage
Title
Cited by
Cited by
Year
A survey on private information retrieval
W Gasarch
Bulletin of the EATCS 82 (72-107), 113, 2004
2992004
Some connections between bounded query classes and nonuniform complexity
A Amir, R Beigel, WI Gasarch
Proceedings Fifth Annual Structure in Complexity Theory Conference, 232-243, 1990
1331990
The p=? np poll
WI Gasarch
Sigact News 33 (2), 34-47, 2002
1182002
Terse, superterse, and verbose sets
R Beigel, WI Gasarch, J Gill, JC Owings
Information and Computation 103 (1), 68-85, 1993
991993
Polynomial terse sets
A Amir, WI Gasarch
Information and Computation 77 (1), 37-56, 1988
861988
Learning via queries
WI Gasarch, CH Smith
Journal of the ACM (JACM) 39 (3), 649-674, 1992
851992
Extremes in the degrees of inferability
L Fortnow, W Gasarch, S Jain, E Kinber, M Kummer, S Kurtz, ...
Annals of pure and applied logic 66 (3), 231-276, 1994
651994
Guest column: The second P=? NP poll
WI Gasarch
ACM SIGACT News 43 (2), 53-77, 2012
642012
Learning via queries to an oracle
WIGMB Pleszkochi
COLT'89: Proceedings of the Second Annual Workshop, UC Santa Cruz …, 2014
452014
On the complexity of finding the chromatic number of a recursive graph I: The bounded case
R Beigel, WI Gasarch
Annals of Pure and Applied logic 45 (1), 1-38, 1989
421989
Bounded query classes and the difference hierarchy
R Beigel, WI Gasarch, L Hay
Archive for Mathematical Logic 29 (2), 69-84, 1989
421989
Bounded queries in recursion theory
WS Levine, G Martin
Springer Science & Business Media, 1998
401998
Rectangle free coloring of grids
S Fenner, W Gasarch, C Glover, S Purewal
arXiv preprint arXiv:1005.3750, 2010
352010
OptP as the normal behavior of NP-complete problems
WI Gasarch, MW Krentel, KJ Rappoport
Mathematical Systems Theory 28 (6), 487-514, 1995
321995
A survey of recursive combinatorics
W Gasarch
Studies in Logic and the Foundations of Mathematics 139, 1041-1176, 1998
311998
Bounded Queries in Recursion Theory: A Survey.
WI Gasarch
Computational Complexity Conference, 62-78, 1991
311991
Frequency computation and bounded queries
R Beigel, W Gasarch, E Kinber
Theoretical Computer Science 163 (1-2), 177-192, 1996
301996
Training sequences
D Angluin, WI Gasarch, CH Smith
Theoretical Computer Science 66 (3), 255-272, 1989
301989
Learning via queries in [+,<]
WI Gasarch, MG Pleszkoch, R Solovay
The Journal of Symbolic Logic 57 (1), 53-81, 1992
271992
Finding large 3-free sets I: The small n case
W Gasarch, J Glenn, CP Kruskal
Journal of Computer and System Sciences 74 (4), 628-655, 2008
262008
The system can't perform the operation now. Try again later.
Articles 1–20