C. Seshadhri
Title
Cited by
Cited by
Year
Community structure and scale-free collections of Erdős-Rényi graphs
C Seshadhri, TG Kolda, A Pinar
Physical Review E 85 (5), 056109, 2012
2522012
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
DF Gleich, C Seshadhri
Proceedings of the 18th ACM SIGKDD international conference on Knowledge …, 2012
1972012
Efficient learning algorithms for changing environments
E Hazan, C Seshadhri
Proceedings of the 26th Annual International Conference on Machine Learning …, 2009
173*2009
A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox
M Jha, C Seshadhri, A Pinar
ACM Transactions on Knowledge Discovery from Data (TKDD) 9 (3), 1-21, 2015
164*2015
Wedge sampling for computing clustering coefficients and triangle counts on large graphs
C Seshadhri, A Pinar, TG Kolda
Statistical Analysis and Data Mining: The ASA Data Science Journal 7 (4 …, 2014
144*2014
A scalable generative graph model with community structure
TG Kolda, A Pinar, T Plantenga, C Seshadhri
SIAM Journal on Scientific Computing 36 (5), C424-C452, 2014
1352014
Estimating the distance to a monotone function
N Ailon, B Chazelle, S Comandur, D Liu
Random Structures & Algorithms 31 (3), 371-383, 2007
1022007
Path sampling: A fast and provable method for estimating 4-vertex subgraph counts
M Jha, C Seshadhri, A Pinar
Proceedings of the 24th International Conference on World Wide Web, 495-505, 2015
982015
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube
D Chakrabarty, C Seshadhri
SIAM Journal on Computing 45 (2), 461-472, 2016
842016
FAST-PPR: scaling personalized pagerank estimation for large graphs
PA Lofgren, S Banerjee, A Goel, C Seshadhri
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
822014
Escape: Efficiently counting all 5-vertex subgraphs
A Pinar, C Seshadhri, V Vishal
Proceedings of the 26th International Conference on World Wide Web, 1431-1440, 2017
802017
Finding the hierarchy of dense subgraphs using nucleus decompositions
AE Sariyuce, C Seshadhri, A Pinar, UV Catalyurek
Proceedings of the 24th International Conference on World Wide Web, 927-937, 2015
792015
Approximately counting triangles in sublinear time
T Eden, A Levi, D Ron, C Seshadhri
SIAM Journal on Computing 46 (5), 1603-1646, 2017
782017
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
D Chakrabarty, C Seshadhri
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
732013
Counting triangles in massive graphs with MapReduce
TG Kolda, A Pinar, T Plantenga, C Seshadhri, C Task
SIAM Journal on Scientific Computing 36 (5), S48-S77, 2014
682014
An expansion tester for bounded degree graphs
S Kale, C Seshadhri
SIAM Journal on Computing 40 (3), 709-720, 2011
63*2011
Blackbox identity testing for bounded top-fanin depth-3 circuits: The field doesn't matter
N Saxena, C Seshadhri
SIAM Journal on Computing 41 (5), 1285-1298, 2012
602012
Local monotonicity reconstruction
M Saks, C Seshadhri
SIAM Journal on Computing 39 (7), 2897-2926, 2010
60*2010
An in-depth study of stochastic Kronecker graphs
C Seshadhri, A Pinar, TG Kolda
2011 IEEE 11th International Conference on Data Mining, 587-596, 2011
592011
From Sylvester-Gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits
N Saxena, C Seshadhri
Journal of the ACM (JACM) 60 (5), 1-33, 2013
542013
The system can't perform the operation now. Try again later.
Articles 1–20