C. Seshadhri

发表

learning algorithms for changing environments

Elad Hazan, C. Seshadhri, Elad Hazan, 2009 .

Testing cycle-freeness: Finding a certificate

C. Seshadhri, 2009 .

A simpler sublinear algorithm for approximating the triangle count

C. Seshadhri, C. Seshadhri, 2015, ArXiv.

Random walks and forbidden minors II: A $\text{poly}(d\varepsilon^{-1})$-query tester for minor-closed properties of bounded-degree graphs

Akash Kumar, Andrew Stolman, C. Seshadhri, 2019 .

Final Report: Sublinear Algorithms for In-situ and In-transit Data Analysis at Exascale.

Ali Pinar, David C. Thompson, Janine Camille Bennett, 2015 .

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles pdf

C. Seshadhri, Suman K. Bera, Noujan Pashanasangi, 2020, SODA.

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

Andrew Stolman, C. Seshadhri, Caleb C. Levy, 2022, SDM.

Random walks and forbidden minors III: poly(d/{\epsilon})-time partition oracles for minor-free graph classes

Akash Kumar, Andrew Stolman, C. Seshadhri, 2021, 2102.00556.

Randomized Algorithms for Scientific Computing (RASC) pdf

Mihai Anitescu, Stephen J. Wright, Draguna Vrabie, 2021, ArXiv.

Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions

Ümit V. Çatalyürek, Ahmet Erdem Sariyüce, C. Seshadhri, 2014 .