A survey on private information retrieval W Gasarch Bulletin of the EATCS 82 (72-107), 113, 2004 | 335 | 2004 |
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 | 135 | 1990 |
The p=? np poll WI Gasarch Sigact News 33 (2), 34-47, 2002 | 124 | 2002 |
Terse, superterse, and verbose sets R Beigel, WI Gasarch, J Gill, JC Owings Information and Computation 103 (1), 68-85, 1993 | 101 | 1993 |
Polynomial terse sets A Amir, WI Gasarch Information and Computation 77 (1), 37-56, 1988 | 93 | 1988 |
Learning via queries WI Gasarch, CH Smith Journal of the ACM (JACM) 39 (3), 649-674, 1992 | 90 | 1992 |
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 | 72 | 1994 |
Guest column: The second P=? NP poll WI Gasarch ACM SIGACT News 43 (2), 53-77, 2012 | 65 | 2012 |
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 | 50 | 1989 |
Learning via queries to an oracle WIGMB Pleszkochi COLT'89: Proceedings of the Second Annual Workshop, UC Santa Cruz …, 2014 | 46 | 2014 |
Bounded queries in recursion theory W Levine, G Martin Springer Science & Business Media, 2012 | 41 | 2012 |
Bounded query classes and the difference hierarchy R Beigel, WI Gasarch, L Hay Archive for Mathematical Logic 29 (2), 69-84, 1989 | 40 | 1989 |
Problems on algorithms I Parberry, W Gasarch Dover Publications, 2007 | 39 | 2007 |
Rectangle free coloring of grids S Fenner, W Gasarch, C Glover, S Purewal arXiv preprint arXiv:1005.3750, 2010 | 36 | 2010 |
A survey of recursive combinatorics W Gasarch Studies in Logic and the Foundations of Mathematics 139, 1041-1176, 1998 | 36 | 1998 |
OptP as the normal behavior of NP-complete problems WI Gasarch, MW Krentel, KJ Rappoport Mathematical Systems Theory 28 (6), 487-514, 1995 | 35 | 1995 |
Training sequences D Angluin, WI Gasarch, CH Smith Theoretical Computer Science 66 (3), 255-272, 1989 | 34 | 1989 |
Bounded Queries in Recursion Theory: A Survey. WI Gasarch SCT, 62-78, 1991 | 33 | 1991 |
Frequency computation and bounded queries R Beigel, W Gasarch, E Kinber Theoretical Computer Science 163 (1-2), 177-192, 1996 | 31 | 1996 |
Limits on the computational power of random strings E Allender, L Friedman, W Gasarch Information and Computation 222, 80-92, 2013 | 29 | 2013 |