Andrew Stolman

According to our database1, Andrew Stolman authored at least 16 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop.
Proceedings of the Artificial Intelligence in Education - 25th International Conference, 2024

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.
SIAM J. Comput., December, 2023

2022
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021
Big Data & Spectral Graph Theory.
PhD thesis, 2021

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes.
Electron. Colloquium Comput. Complex., 2021

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

Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes.
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.
Proc. Natl. Acad. Sci. USA, 2020

2019
andom walks and forbidden minors II: A poly(dε<sup>-1</sup>)$-query tester for minor-closed properties of bounded degree graphs.
Electron. Colloquium Comput. Complex., 2019

Random walks and forbidden minors II: A poly(dε<sup>-1</sup>)-query tester for minor-closed properties of bounded-degree graphs.
CoRR, 2019

Random walks and forbidden minors II: a poly(<i>d ε</i><sup>-1</sup>)-query tester for minor-closed properties of bounded degree graphs.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Finding forbidden minors in sublinear time: a O(n<sup>1/2+o(1)</sup>)-query one-sided tester for minor closed properties on bounded degree graphs.
Electron. Colloquium Comput. Complex., 2018

Finding forbidden minors in sublinear time: a n<sup>1/2+o(1)</sup>-query one-sided tester for minor closed properties on bounded degree graphs.
Electron. Colloquium Comput. Complex., 2018

Fiding forbidden minors in sublinear time: a O(n<sup>1/2 + o(1)</sup>)-query one-sided tester for minor closed properties on bounded degree graphs.
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.
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.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017


  Loading...