William Gasarch (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "William Gasarch" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

3umd.edu

1,747^th place

1,277^th place

3arxiv.org

69^th place

59^th place

3worldcat.org

5^th place

2computationalcomplexity.org

low place

2worldscientific.com

low place

9,148^th place

1youtube.com

9^th place

13^th place

1ams.org

451^st place

277^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1springer.com

274^th place

309^th place

1books.google.com

3^rd place

ams.org

Conway, John H.; Jackson, Allyn (July 1996). "Budding Mathematician Wins Westinghouse Competition" (PDF). Notices of the American Mathematical Society. Retrieved 2016-09-26.

arxiv.org

Gasarch, William; Haeupler, Bernhard (2011). "Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive". Electronic Journal of Combinatorics. 18 (64). arXiv:1005.3749. doi:10.37236/551. S2CID 534179.
Gasarch, William; Haeupler, Bernhard (2010). "Rectangle Free Coloring of Grids". arXiv:1005.3750 [math.CO].
Gasarch, William; Haeupler, Bernhard (2011). "Proving programs terminate using well orderings, Ramsey Theory, and Matrices". arXiv:1108.3347 [math.CO].

books.google.com

Gasarch, William; Metz, Erik; Prinz, Jacob; Smolyak, Daniel (28 May 2020). Mathematical Muffin Morsels: Nobody Wants A Small Piece. World Scientific. ISBN 978-981-12-1519-3.

computationalcomplexity.org

blog.computationalcomplexity.org

"Still Typecasting from Dagstuhl". Computational Complexity Weblog. Lance Fortnow and William Gasarch. Retrieved 27 September 2018.
http://blog.computationalcomplexity.org/ Computational Complexity Weblog

doi.org

Gasarch, William; Haeupler, Bernhard (2011). "Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive". Electronic Journal of Combinatorics. 18 (64). arXiv:1005.3749. doi:10.37236/551. S2CID 534179.
Hemaspaandra, Lane A. (2002-06-01). "SIGACT news complexity theory column 36". ACM SIGACT News. 33 (2): 34–47. doi:10.1145/564585.564599. ISSN 0163-5700. S2CID 36828694.
Hemaspaandra, Lane A. (2012-06-11). "SIGACT news complexity theory column 74". ACM SIGACT News. 43 (2): 51–52. doi:10.1145/2261417.2261433. ISSN 0163-5700. S2CID 52847337.
Gasarch, William I. (2019-03-13). "Guest Column: The Third P=?NP Poll". ACM SIGACT News. 50 (1): 38–59. doi:10.1145/3319627.3319636. ISSN 0163-5700. S2CID 83458626.

mathgenealogy.org

William Gasarch at the Mathematics Genealogy Project

semanticscholar.org

api.semanticscholar.org

Gasarch, William; Haeupler, Bernhard (2011). "Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive". Electronic Journal of Combinatorics. 18 (64). arXiv:1005.3749. doi:10.37236/551. S2CID 534179.
Hemaspaandra, Lane A. (2002-06-01). "SIGACT news complexity theory column 36". ACM SIGACT News. 33 (2): 34–47. doi:10.1145/564585.564599. ISSN 0163-5700. S2CID 36828694.
Hemaspaandra, Lane A. (2012-06-11). "SIGACT news complexity theory column 74". ACM SIGACT News. 43 (2): 51–52. doi:10.1145/2261417.2261433. ISSN 0163-5700. S2CID 52847337.
Gasarch, William I. (2019-03-13). "Guest Column: The Third P=?NP Poll". ACM SIGACT News. 50 (1): 38–59. doi:10.1145/3319627.3319636. ISSN 0163-5700. S2CID 83458626.

springer.com

https://www.springer.com/us/book/9780817639662 Bounded Queries in Recursion Theory (with Georgia Martin), Birkhauser, 1999

umd.edu

cs.umd.edu

Gasarch, William (March 16, 2023). "Curriculum vitae" (PDF). U. Maryland Computer Science. Retrieved 2024-02-14.
http://www.cs.umd.edu/~gasarch/papers/gems.pdf Gems in the Field of Bounded Queries by William Gasarch, 2003
http://www.cs.umd.edu/~gasarch/papers/lvqsur.pdf A Survey of Inductive Inference with an Emphasis on Queries, Gasarch and Smith, 1997

worldcat.org

search.worldcat.org

Hemaspaandra, Lane A. (2002-06-01). "SIGACT news complexity theory column 36". ACM SIGACT News. 33 (2): 34–47. doi:10.1145/564585.564599. ISSN 0163-5700. S2CID 36828694.
Hemaspaandra, Lane A. (2012-06-11). "SIGACT news complexity theory column 74". ACM SIGACT News. 43 (2): 51–52. doi:10.1145/2261417.2261433. ISSN 0163-5700. S2CID 52847337.
Gasarch, William I. (2019-03-13). "Guest Column: The Third P=?NP Poll". ACM SIGACT News. 50 (1): 38–59. doi:10.1145/3319627.3319636. ISSN 0163-5700. S2CID 83458626.

worldscientific.com

https://www.worldscientific.com/worldscibooks/10.1142/11261 Problems with a Point Exploring Math and Computer Science, 2019
https://www.worldscientific.com/doi/abs/10.1142/9789813279735_0014 Chapter 14: Is This Problem Too Hard for a High School Math Competition?, 2019

youtube.com

"Rectangle Free Colorings – William Gasarch". YouTube. May 8, 2017. Retrieved 12 October 2022.