Andrew Stolman

According to our database, Andrew Stolman authored at least 15 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

SIAM J. Comput., December, 2023

2022

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling.

Andrew Stolman, Caleb Levy, C. Seshadhri, Aneesh Sharma

Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021

Big Data & Spectral Graph Theory.

Andrew Stolman

PhD thesis, 2021

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2021

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2021

Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

The impossibility of low-rank representations for triangle-rich complex networks.

C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel

Proc. Natl. Acad. Sci. USA, 2020

2019

andom walks and forbidden minors II: A poly(dε^-1)$-query tester for minor-closed properties of bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2019

Random walks and forbidden minors II: A poly(dε^-1)-query tester for minor-closed properties of bounded-degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2019

Random walks and forbidden minors II: a poly(<i>d ε</i>^-1)-query tester for minor-closed properties of bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Finding forbidden minors in sublinear time: a O(n^1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2018

Finding forbidden minors in sublinear time: a n^1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2018

Fiding forbidden minors in sublinear time: a O(n^{1/2 + o(1)})-query one-sided tester for minor closed properties on bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2018

Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs.

Andrew Stolman, Kevin Matulef

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017