William Gasarch - Concepedia

Author

William Gasarch

University of Maryland, College Park ORCID

Also Known As

Bill Gasarch, Gasarch, William, W. Gasarch, W. I. Gasarch, W. Ian Gasarch, W.I. Gasarch, William Gasarch, William I. Gasarch

311

Publications

1.9K

Citations

H-Index

Concepts

All Affiliations

University of Maryland, College Park Johns Hopkins University Institute for Advanced Study University of Illinois Chicago IBM (United States)

About

William Gasarch is an author at University of Maryland, College Park specializing in engineering, computer science, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	11	15	317
2	Language Studies	3	3	83
3	Arts	1	1	11
4	Education	1	1	22
5	Humanities	1	1	22

William Gasarch

Publications

1.4K

Citations

H-Index

Page 1

	Year	Citations
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) William Gasarch ACM SIGACT News	1997	585
A Survey on Private Information Retrieval William Gasarch	2004	209
A Survey on Private Information Retrieval (Column: Computational Complexity). William Gasarch Bulletin of the European Association for Theoretical Computer Science	2004	67
Terse, Superterse, and Verbose Sets Richard Beigel, William Gasarch, John Gill, Information and Computation SyntaxAutomated ReasoningExtremal Set TheoryLanguage StudiesLogical Formalism	1993	61
Polynomial terse sets Amihood Amir, William Gasarch Information and Computation Combinatorial DesignExtremal Set TheoryDiscrete MathematicsPolynomial Terse SetsReal Algebraic Geometry	1988	56
Learning via queries William Gasarch, Carl H. Smith Journal of the ACM EngineeringMachine LearningQuery ModelFunction FQuery Suggestion	1992	56
Learning via queries to an oracle William Gasarch, Mark G. Pleszkoch Conference on Learning Theory Computational Complexity TheoryEngineeringMachine LearningComputational Model TheoryPassive Inductive Inference	1989	39
On the complexity of finding the chromatic number of a recursive graph I: the bounded case Richard Beigel, William Gasarch Annals of Pure and Applied Logic EngineeringGraph TheoryRecursive GraphAlgebraic Graph TheoryStructural Graph Theory	1989	34
Training sequences Dana Angluin, William Gasarch, Carl H. Smith Theoretical Computer Science	1989	30
A tight lower bound for restricted pir protocols Richard Beigel, Lance Fortnow, William Gasarch Computational Complexity EngineeringLower BoundFormal MethodsTight Lower BoundPrivate Information Retrieval	2006	25

Page 1