C. Seshadhri

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 83

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

SIAM J. Comput.

SODA

Publications

Andrew Stolman, Caleb Levy, C. Seshadhri, Aneesh Sharma
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR (2022)
Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS (2022)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS (2022)
Sabyasachi Basu, Akash Kumar, C. Seshadhri
The complexity of testing all properties of planar graphs, and the role of isomorphism. Electron. Colloquium Comput. Complex. 28 (2021)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. 28 (2021)
Noujan Pashanasangi, C. Seshadhri
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. CoRR (2021)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR (2021)
Aydin Buluç, Tamara G. Kolda, Stefan M. Wild, Mihai Anitescu, Anthony DeGennaro, John Jakeman, Chandrika Kamath, Ramakrishnan Kannan, Miles E. Lopes, Per-Gunnar Martinsson, Kary Myers, Jelani Nelson, Juan M. Restrepo, C. Seshadhri, Draguna L. Vrabie, Brendt Wohlberg, Stephen J. Wright, Chao Yang, Peter Zwart
Randomized Algorithms for Scientific Computing (RASC). CoRR (2021)
Sabyasachi Basu, Akash Kumar, C. Seshadhri
The complexity of testing all properties of planar graphs, and the role of isomorphism. CoRR (2021)
Noujan Pashanasangi, C. Seshadhri
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. KDD (2021)
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. SODA (2021)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49 (2) (2020)
Suman K. Bera, C. Seshadhri
How to Count Triangles, without Seeing the Whole Graph. KDD (2020)
Shweta Jain, C. Seshadhri
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. WWW (2020)
Suman K. Bera, C. Seshadhri
How the Degeneracy Helps for Triangle Counting in Graph Streams. CoRR (2020)
Shweta Jain, C. Seshadhri
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. CoRR (2020)
C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. USA 117 (11) (2020)
Shweta Jain, C. Seshadhri
The Power of Pivoting for Exact Clique Counting. WSDM (2020)
Talya Eden, Dana Ron, C. Seshadhri
-cliques in low-arboricity graphs. SODA (2020)
Talya Eden, Dana Ron, C. Seshadhri
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49 (4) (2020)
Suman K. Bera, C. Seshadhri
How to Count Triangles, without Seeing the Whole Graph. CoRR (2020)
Tim Roughgarden, C. Seshadhri
Distribution-Free Models of Social Networks. CoRR (2020)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
-Dimensions. SODA (2020)
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS (2020)
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. CoRR (2020)
Shweta Jain, C. Seshadhri
The Power of Pivoting for Exact Clique Counting. CoRR (2020)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Theory Comput. 16 (2020)
Suman K. Bera, C. Seshadhri
How the Degeneracy Helps for Triangle Counting in Graph Streams. PODS (2020)
C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
The impossibility of low rank representations for triangle-rich complex networks. CoRR (2020)
Noujan Pashanasangi, C. Seshadhri
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. WSDM (2020)
Akash Kumar, C. Seshadhri, Andrew Stolman
andom walks and forbidden minors II: A $\poly(d\eps^{-1})$-query tester for minor-closed properties of bounded degree graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. 33 (4) (2019)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query tester for minor-closed properties of bounded degree graphs. STOC (2019)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query tester for minor-closed properties of bounded-degree graphs. CoRR (2019)
Noujan Pashanasangi, C. Seshadhri
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. CoRR (2019)
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. CoRR (2019)
Deeparnab Chakrabarty, C. Seshadhri
Adaptive Boolean Monotonicity Testing in Total Influence Time. ITCS (2019)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR (2018)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. CoRR (2018)
Talya Eden, Dana Ron, C. Seshadhri
On approximating the number of k-cliques in sublinear time. STOC (2018)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. 12 (1) (2018)
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. 25 (2018)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids. Electron. Colloquium Comput. Complex. 25 (2018)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP (2018)
Talya Eden, Dana Ron, C. Seshadhri
Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
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 (2018)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
. SODA (2018)
Deeparnab Chakrabarty, C. Seshadhri
Adaptive Boolean Monotonicity Testing in Total Influence Time. Electron. Colloquium Comput. Complex. 25 (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. 25 (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query one-sided tester for minor closed properties on bounded degree graphs. CoRR (2018)
Deeparnab Chakrabarty, C. Seshadhri
Adaptive Boolean Monotonicity Testing in Total Influence Time. CoRR (2018)
Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. ACM Trans. Algorithms 13 (2) (2017)
Benjamin Raichel, C. Seshadhri
Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 58 (4) (2017)
C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
Directed closure measures for networks with reciprocity. J. Complex Networks 5 (1) (2017)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
. Electron. Colloquium Comput. Complex. 24 (2017)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR (2017)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. Electron. Colloquium Comput. Complex. 24 (2017)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. ICALP (2017)
Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. WWW (2017)
Aneesh Sharma, C. Seshadhri, Ashish Goel
When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. WWW (2017)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP (2017)
Aneesh Sharma, C. Seshadhri, Ashish Goel
When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. CoRR (2017)
Shweta Jain, C. Seshadhri
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. WWW (2017)
Michael E. Saks, C. Seshadhri
Estimating the Longest Increasing Sequence in Polylogarithmic Time. SIAM J. Comput. 46 (2) (2017)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. CoRR (2017)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
. CoRR (2017)
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR (2017)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. CoRR (2017)
Talya Eden, Dana Ron, C. Seshadhri
On Approximating the Number of $k$-cliques in Sublinear Time. CoRR (2017)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web 11 (3) (2017)
Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46 (5) (2017)
Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Electron. Colloquium Comput. Complex. 24 (2017)
Timothy Naumovitz, Michael E. Saks, C. Seshadhri
Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance. SODA (2017)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR (2016)
Rishi Gupta, Tim Roughgarden, C. Seshadhri
Decompositions of Triangle-Dense Graphs. SIAM J. Comput. 45 (2) (2016)
Benjamin Raichel, C. Seshadhri
Avoiding the Global Sort: A Faster Contour Tree Algorithm. SoCG (2016)
Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, Ali Pinar, Maher Salloum, C. Seshadhri
Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling. SIAM J. Sci. Comput. 38 (5) (2016)
Deeparnab Chakrabarty, C. Seshadhri
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput. 45 (2) (2016)
Deeparnab Chakrabarty, C. Seshadhri
A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. CoRR (2016)
Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. CoRR (2016)
Deeparnab Chakrabarty, C. Seshadhri
A Õ(n) Non-Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. 23 (2016)
Shweta Jain, C. Seshadhri
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. CoRR (2016)
Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, C. Seshadhri, Ali Pinar, Maher Salloum
Trigger detection for adaptive scientific workflows using percentile sampling. CoRR (2015)
C. Seshadhri
A simpler sublinear algorithm for approximating the triangle count. CoRR (2015)
Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? Internet Math. 11 (6) (2015)
Olivia Simpson, C. Seshadhri, Andrew McGregor
Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution. ICDM (2015)
Madhav Jha, C. Seshadhri, Ali Pinar
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox. ACM Trans. Knowl. Discov. Data 9 (3) (2015)
Olivia Simpson, C. Seshadhri, Andrew McGregor
Catching the head, the tail, and everything in between: a streaming algorithm for the degree distribution. CoRR (2015)
Madhav Jha, Ali Pinar, C. Seshadhri
Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC (2015)
Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. SODA (2015)
Jaideep Ray, Ali Pinar, C. Seshadhri
A stopping criterion for Markov chains when generating independent random graphs. J. Complex Networks 3 (2) (2015)
Madhav Jha, C. Seshadhri, Ali Pinar
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW (2015)
Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
Approximately Counting Triangles in Sublinear Time. FOCS (2015)
Grey Ballard, Ali Pinar, Tamara G. Kolda, C. Seshadhri
Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search. CoRR (2015)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW (2015)
Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri
Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. ICDM (2015)
Jonathan W. Berry, Luke K. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson
Why do simple algorithms for triangle enumeration work in the real world? ITCS (2014)
C. Seshadhri, Andrew M. Smith, Yevgeniy Vorobeychik, Jackson R. Mayo, Robert C. Armstrong
Characterizing short-term stability for Boolean networks over any distribution of transfer functions. CoRR (2014)
Peter Lofgren, Siddhartha Banerjee, Ashish Goel, C. Seshadhri
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. CoRR (2014)

C. Seshadhri.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

C. Seshadhri