Andrew Stolman

21 papers A* 3A 1B 1Journal 13Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Investigating Student Interaction Patterns with Large Language Model-Powered Course Assistants in Computer Science Courses. CoRR Chang Liu, Loc Hoang, Andrew Stolman, René F. Kizilcec, Bo Wu
2025	—	`conf`	Understanding Student Engagement with Large Language Model-Powered Course Assistants. AIED (6) Chang Liu, Loc Hoang, Andrew Stolman, René F. Kizilcec, Bo Wu
2024	—	`conf`	HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop. AIED (2) Chang Liu, Loc Hoang, Andrew Stolman, Bo Wu
2023	J	`jnl`	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. Akash Kumar, C. Seshadhri, Andrew Stolman
2022	A	`conf`	Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma
2022	J	`jnl`	Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma
2021	—	`—`	Big Data & Spectral Graph Theory. Andrew Stolman
2021	A*	`conf`	Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS Akash Kumar, C. Seshadhri, Andrew Stolman
2021	J	`jnl`	Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2021	J	`jnl`	Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2020	J	`jnl`	The impossibility of low rank representations for triangle-rich complex networks. CoRR C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
2020	J	`jnl`	The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. USA C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
2019	J	`jnl`	Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs. SIAM J. Comput. Akash Kumar, C. Seshadhri, Andrew Stolman
2019	J	`jnl`	Random walks and forbidden minors II: A poly(dε CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2019	A*	`conf`	Random walks and forbidden minors II: a poly( STOC Akash Kumar, C. Seshadhri, Andrew Stolman
2019	J	`jnl`	andom walks and forbidden minors II: A poly(dε Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Fiding forbidden minors in sublinear time: a O(n CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2018	A*	`conf`	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 Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Finding forbidden minors in sublinear time: a O(n Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Finding forbidden minors in sublinear time: a n Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2017	B	`conf`	HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs. ASONAM Andrew Stolman, Kevin Matulef