default search action
Andrew Stolman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Chang Liu
, Loc Hoang, Andrew Stolman, Bo Wu
HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop. AIED (2) 2024: 405-412 - 2023
- [j2]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. SIAM J. Comput. 52(6): S18-216 (2023) - 2022
- [c5]Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma:
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM 2022: 388-396 - [i9]Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma:
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR abs/2201.08481 (2022) - 2021
- [b1]Andrew Stolman:
Big Data & Spectral Graph Theory. University of California, Santa Cruz, USA, 2021 - [c4]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS 2021: 257-268 - [i8]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR abs/2102.00556 (2021) - [i7]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel:
The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. USA 117(11): 5631-5637 (2020) - [i6]C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel:
The impossibility of low rank representations for triangle-rich complex networks. CoRR abs/2003.12635 (2020)
2010 – 2019
- 2019
- [c3]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. STOC 2019: 559-567 - [i5]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: A poly(dε-1)-query tester for minor-closed properties of bounded-degree graphs. CoRR abs/1904.01055 (2019) - [i4]Akash Kumar, C. Seshadhri, Andrew Stolman:
andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. FOCS 2018: 509-520 - [i3]Akash Kumar, C. Seshadhri, Andrew Stolman:
Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs. CoRR abs/1805.08187 (2018) - [i2]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i1]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Andrew Stolman, Kevin Matulef:
HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs. ASONAM 2017: 31-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: