default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeshadhri Comandur
C. Seshadhri 0001
Person information
- affiliation: University of California, Santa Cruz, CA, USA
- affiliation (former): Information Security Sciences Department, Sandia National Laboratories, Livermore, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Quanquan C. Liu
, C. Seshadhri:
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC 2024: 519-522- [i107]Quanquan C. Liu, C. Seshadhri:
Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR abs/2405.00262 (2024) - [i106]Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri:
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR abs/2406.08624 (2024) - [i105]Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian:
Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets. CoRR abs/2407.16850 (2024) - [i104]Deeparnab Chakrabarty, C. Seshadhri:
Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. CoRR abs/2409.02206 (2024) - [i103]Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati:
Accurate and Fast Estimation of Temporal Motifs using Path Sampling. CoRR abs/2409.08975 (2024) - 2023
- [j41]Benjamin Raichel, Seshadhri Comandur:
Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 69(1): 1-3 (2023) - [j40]C. Seshadhri:
Limitations of low dimensional graph embeddings. IEEE Data Eng. Bull. 46(2): 96-107 (2023) - [j39]Akash Kumar, C. Seshadhri, Andrew Stolman:
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. 52(6): S18-216 (2023) - [c74]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. FOCS 2023: 1796-1821 - [c73]C. Seshadhri:
Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). ICDT 2023: 3:1-3:10 - [c72]Yufan Huang, C. Seshadhri, David F. Gleich:
Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming. ICML 2023: 13976-13992 - [c71]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC 2023: 233-241 - [i102]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. CoRR abs/2304.01416 (2023) - [i101]Daniel Paul-Pena, C. Seshadhri:
A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs. CoRR abs/2311.09584 (2023) - [i100]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j38]Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. J. ACM 69(3): 23:1-23:21 (2022) - [c70]Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri:
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS 2022: 17:1-17:24 - [c69]Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma:
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM 2022: 388-396 - [c68]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA 2022: 1702-1714 - [i99]Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma:
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR abs/2201.08481 (2022) - [i98]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR abs/2211.05281 (2022) - [i97]Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri:
Spectral Triadic Decompositions of Real-World Networks. CoRR abs/2211.06352 (2022) - [i96]Daniel Paul-Pena, C. Seshadhri:
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. CoRR abs/2211.08605 (2022) - [i95]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c67]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 2021: 257-268 - [c66]Noujan Pashanasangi, C. Seshadhri:
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. KDD 2021: 1319-1328 - [c65]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. SODA 2021: 2315-2332 - [i94]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR abs/2102.00556 (2021) - [i93]Aydin Buluç, Tamara G. Kolda, Stefan M. Wild, Mihai Anitescu, Anthony M. DeGennaro, John Jakeman, Chandrika Kamath, Ramakrishnan Kannan, Miles E. Lopes, Per-Gunnar Martinsson, Kary L. 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 abs/2104.11079 (2021) - [i92]Noujan Pashanasangi, C. Seshadhri:
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. CoRR abs/2106.02762 (2021) - [i91]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. CoRR abs/2108.10547 (2021) - [i90]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. Electron. Colloquium Comput. Complex. TR21 (2021) - [i89]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. TR21 (2021) - 2020
- [j37]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): 5631-5637 (2020) - [j36]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): 448-464 (2020) - [j35]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49(4): 747-771 (2020) - [j34]Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri:
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Theory Comput. 16: 1-36 (2020) - [c64]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS 2020: 38:1-38:20 - [c63]Suman K. Bera, C. Seshadhri:
How to Count Triangles, without Seeing the Whole Graph. KDD 2020: 306-316 - [c62]Suman K. Bera, C. Seshadhri:
How the Degeneracy Helps for Triangle Counting in Graph Streams. PODS 2020: 457-467 - [c61]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. SODA 2020: 1467-1478 - [c60]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions. SODA 2020: 1975-1994 - [c59]Shweta Jain, C. Seshadhri:
The Power of Pivoting for Exact Clique Counting. WSDM 2020: 268-276 - [c58]Noujan Pashanasangi, C. Seshadhri:
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. WSDM 2020: 447-455 - [c57]Shweta Jain, C. Seshadhri:
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. WWW 2020: 1966-1976 - [p4]C. Seshadhri:
Self-Improving Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 259-282 - [p3]Tim Roughgarden, C. Seshadhri:
Distribution-Free Models of Social Networks. Beyond the Worst-Case Analysis of Algorithms 2020: 606-625 - [i88]Shweta Jain, C. Seshadhri:
The Power of Pivoting for Exact Clique Counting. CoRR abs/2001.06784 (2020) - [i87]C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel:
The impossibility of low rank representations for triangle-rich complex networks. CoRR abs/2003.12635 (2020) - [i86]Suman K. Bera, C. Seshadhri:
How the Degeneracy Helps for Triangle Counting in Graph Streams. CoRR abs/2003.13151 (2020) - [i85]Suman K. Bera, C. Seshadhri:
How to Count Triangles, without Seeing the Whole Graph. CoRR abs/2006.11947 (2020) - [i84]Shweta Jain, C. Seshadhri:
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. CoRR abs/2006.13483 (2020) - [i83]Tim Roughgarden, C. Seshadhri:
Distribution-Free Models of Social Networks. CoRR abs/2007.15743 (2020) - [i82]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. CoRR abs/2010.08083 (2020)
2010 – 2019
- 2019
- [j33]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. 33(4): 2267-2285 (2019) - [c56]Deeparnab Chakrabarty, C. Seshadhri:
Adaptive Boolean Monotonicity Testing in Total Influence Time. ITCS 2019: 20:1-20:7 - [c55]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. STOC 2019: 559-567 - [c54]Seshadhri Comandur, Srikanta Tirthapura:
Scalable Subgraph Counting: The Methods Behind The Madness. WWW (Companion Volume) 2019: 1317-1318 - [i81]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: A poly(dε-1)-query tester for minor-closed properties of bounded-degree graphs. CoRR abs/1904.01055 (2019) - [i80]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. CoRR abs/1911.05896 (2019) - [i79]Noujan Pashanasangi, C. Seshadhri:
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. CoRR abs/1911.10616 (2019) - [i78]Akash Kumar, C. Seshadhri, Andrew Stolman:
andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j32]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. 12(1): 43-56 (2018) - [c53]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: 509-520 - [c52]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP 2018: 55:1-55:15 - [c51]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. SODA 2018: 2133-2151 - [c50]Talya Eden, Dana Ron, C. Seshadhri:
On approximating the number of k-cliques in sublinear time. STOC 2018: 722-734 - [c49]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW 2018: 449-458 - [i77]Deeparnab Chakrabarty, C. Seshadhri:
Adaptive Boolean Monotonicity Testing in Total Influence Time. CoRR abs/1801.02816 (2018) - [i76]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR abs/1804.07431 (2018) - [i75]Akash Kumar, C. Seshadhri, Andrew Stolman:
Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs. CoRR abs/1805.08187 (2018) - [i74]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. CoRR abs/1811.01427 (2018) - [i73]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR abs/1811.04425 (2018) - [i72]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i71]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids. Electron. Colloquium Comput. Complex. TR18 (2018) - [i70]Deeparnab Chakrabarty, C. Seshadhri:
Adaptive Boolean Monotonicity Testing in Total Influence Time. Electron. Colloquium Comput. Complex. TR18 (2018) - [i69]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j31]C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda:
Directed closure measures for networks with reciprocity. J. Complex Networks 5(1): 32-47 (2017) - [j30]Benjamin Raichel, C. Seshadhri:
Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 58(4): 946-985 (2017) - [j29]Michael E. Saks, C. Seshadhri:
Estimating the Longest Increasing Sequence in Polylogarithmic Time. SIAM J. Comput. 46(2): 774-823 (2017) - [j28]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46(5): 1603-1646 (2017) - [j27]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. ACM Trans. Algorithms 13(2): 20:1-20:30 (2017) - [j26]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): 16:1-16:27 (2017) - [c48]Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri:
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. ICALP 2017: 5:1-5:14 - [c47]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP 2017: 7:1-7:13 - [c46]Timothy Naumovitz, Michael E. Saks, C. Seshadhri:
Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance. SODA 2017: 2012-2031 - [c45]Aneesh Sharma, C. Seshadhri, Ashish Goel:
When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. WWW 2017: 431-440 - [c44]Shweta Jain, C. Seshadhri:
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. WWW 2017: 441-449 - [c43]Ali Pinar, C. Seshadhri, Vaidyanathan Vishal:
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. WWW 2017: 1431-1440 - [i68]Aneesh Sharma, C. Seshadhri, Ashish Goel:
When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. CoRR abs/1703.01054 (2017) - [i67]Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri:
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. CoRR abs/1703.05199 (2017) - [i66]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR abs/1704.00386 (2017) - [i65]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 abs/1706.00053 (2017) - [i64]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of $k$-cliques in Sublinear Time. CoRR abs/1707.04858 (2017) - [i63]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR abs/1710.08607 (2017) - [i62]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. CoRR abs/1710.10545 (2017) - [i61]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. TR17 (2017) - [i60]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. TR17 (2017) - [i59]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j25]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of Triangle-Dense Graphs. SIAM J. Comput. 45(2): 197-215 (2016) - [j24]Deeparnab Chakrabarty, C. Seshadhri:
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput. 45(2): 461-472 (2016) - [j23]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) - [c42]Benjamin Raichel, C. Seshadhri:
Avoiding the Global Sort: A Faster Contour Tree Algorithm. SoCG 2016: 57:1-57:14 - [r1]Seshadhri Comandur:
Local Reconstruction. Encyclopedia of Algorithms 2016: 1136-1139 - [i58]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR abs/1604.03661 (2016) - [i57]Deeparnab Chakrabarty, C. Seshadhri:
A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. CoRR abs/1608.06980 (2016) - [i56]Ali Pinar, C. Seshadhri, Vaidyanathan Vishal:
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. CoRR abs/1610.09411 (2016) - [i55]Shweta Jain, C. Seshadhri:
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. CoRR abs/1611.05561 (2016) - [i54]Deeparnab Chakrabarty, C. Seshadhri:
A Õ(n) Non-Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j22]Jaideep Ray, Ali Pinar, C. Seshadhri:
A stopping criterion for Markov chains when generating independent random graphs. J. Complex Networks 3(2): 204-220 (2015) - [j21]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): 555-571 (2015) - [j20]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): 15:1-15:21 (2015) - [c41]Madhav Jha, Ali Pinar, C. Seshadhri:
Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC 2015: 1507-1514 - [c40]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. FOCS 2015: 614-633 - [c39]Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. ICDM 2015: 11-20 - [c38]Olivia Simpson, C. Seshadhri, Andrew McGregor:
Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution. ICDM 2015: 979-984 - [c37]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. SODA 2015: 1809-1828 - [c36]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW 2015: 495-505 - [c35]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW 2015: 927-937 - [p2]C. Seshadhri, Ali Pinar, David C. Thompson, Janine C. Bennett:
Sublinear Algorithms for Extreme-Scale Data Analysis. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces 2015: 39-54 - [i53]C. Seshadhri:
A simpler sublinear algorithm for approximating the triangle count. CoRR abs/1505.01927 (2015) - [i52]Olivia Simpson, C. Seshadhri, Andrew McGregor:
Catching the head, the tail, and everything in between: a streaming algorithm for the degree distribution. CoRR abs/1506.02574 (2015) - [i51]Grey Ballard, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search. CoRR abs/1506.03872 (2015) - [i50]Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, C. Seshadhri, Ali Pinar, Maher Salloum:
Trigger detection for adaptive scientific workflows using percentile sampling. CoRR abs/1506.08258 (2015) - 2014
- [j19]C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? Algorithmica 69(1): 1-25 (2014) - [j18]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - [j17]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. 7(4): 294-307 (2014) - [j16]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. 43(2): 617-653 (2014) - [j15]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri:
A Scalable Generative Graph Model with Community Structure. SIAM J. Sci. Comput. 36(5) (2014) - [j14]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task:
Counting Triangles in Massive Graphs with MapReduce. SIAM J. Sci. Comput. 36(5) (2014) - [j13]Deeparnab Chakrabarty, C. Seshadhri:
An Optimal Lower Bound for Monotonicity Testing over Hypergrids. Theory Comput. 10: 453-464 (2014) - [c34]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: 225-234 - [c33]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of triangle-dense graphs. ITCS 2014: 471-482 - [c32]Peter Lofgren, Siddhartha Banerjee, Ashish Goel, Seshadhri Comandur:
FAST-PPR: scaling personalized pagerank estimation for large graphs. KDD 2014: 1436-1445 - [i49]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. CoRR abs/1404.0718 (2014) - [i48]Peter Lofgren, Siddhartha Banerjee, Ashish Goel, C. Seshadhri:
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. CoRR abs/1404.3181 (2014) - [i47]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? CoRR abs/1407.1116 (2014) - [i46]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 abs/1409.4360 (2014) - [i45]Benjamin Raichel, C. Seshadhri:
A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm. CoRR abs/1411.2689 (2014) - [i44]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR abs/1411.3312 (2014) - [i43]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. CoRR abs/1411.4942 (2014) - [i42]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j12]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
An in-depth analysis of stochastic Kronecker graphs. J. ACM 60(2): 13:1-13:32 (2013) - [j11]Nitin Saxena, C. Seshadhri:
From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. J. ACM 60(5): 33:1-33:33 (2013) - [j10]Satyen Kale, Yuval Peres, C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. SIAM J. Comput. 42(1): 305-323 (2013) - [c31]Deeparnab Chakrabarty, C. Seshadhri:
An Optimal Lower Bound for Monotonicity Testing over Hypergrids. APPROX-RANDOM 2013: 425-435 - [c30]Madhav Jha, C. Seshadhri, Ali Pinar:
A space efficient streaming algorithm for triangle counting using the birthday paradox. KDD 2013: 589-597 - [c29]David C. Thompson, Janine Bennett, C. Seshadhri, Ali Pinar:
A provably-robust sampling method for generating colormaps of large data. LDAV 2013: 77-84 - [c28]Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal. NSW 2013: 23-30 - [c27]Tamara G. Kolda, Ali Pinar, C. Seshadhri:
Triadic Measures on Graphs: The Power of Wedge Sampling. SDM 2013: 10-18 - [c26]Michael E. Saks, C. Seshadhri:
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. SODA 2013: 1698-1709 - [c25]Deeparnab Chakrabarty, C. Seshadhri:
A o(n) monotonicity tester for boolean functions over the hypercube. STOC 2013: 411-418 - [c24]Deeparnab Chakrabarty, C. Seshadhri:
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. STOC 2013: 419-428 - [i41]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task:
Counting Triangles in Massive Graphs with MapReduce. CoRR abs/1301.5887 (2013) - [i40]Deeparnab Chakrabarty, C. Seshadhri:
A o(n) monotonicity tester for Boolean functions over the hypercube. CoRR abs/1302.4536 (2013) - [i39]C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda:
The importance of directed triangles with reciprocity: patterns and algorithms. CoRR abs/1302.6220 (2013) - [i38]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri:
A Scalable Generative Graph Model with Community Structure. CoRR abs/1302.6636 (2013) - [i37]Deeparnab Chakrabarty, C. Seshadhri:
An optimal lower bound for monotonicity testing over hypergrids. CoRR abs/1304.5264 (2013) - [i36]Michael E. Saks, C. Seshadhri:
Estimating the longest increasing sequence in polylogarithmic time. CoRR abs/1308.0626 (2013) - [i35]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs. CoRR abs/1309.3321 (2013) - [i34]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of Triangle-Dense Graphs. CoRR abs/1309.7440 (2013) - [i33]Madhav Jha, C. Seshadhri, Ali Pinar:
When a Graph is not so Simple: Counting Triangles in Multigraph Streams. CoRR abs/1310.7665 (2013) - [i32]Deeparnab Chakrabarty, C. Seshadhri:
A o(n) monotonicity tester for Boolean functions over the hypercube. Electron. Colloquium Comput. Complex. TR13 (2013) - [i31]Deeparnab Chakrabarty, C. Seshadhri:
An optimal lower bound for monotonicity testing over hypergrids. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j9]Nitin Saxena, C. Seshadhri:
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. SIAM J. Comput. 41(5): 1285-1298 (2012) - [c23]Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Degree relations of triangles in real-world networks and graph models. CIKM 2012: 1712-1716 - [c22]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving algorithms for coordinate-wise maxima. SCG 2012: 277-286 - [c21]David F. Gleich, C. Seshadhri:
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. KDD 2012: 597-605 - [c20]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. SDM 2012: 1071-1082 - [c19]Jaideep Ray, Ali Pinar, C. Seshadhri:
Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. WAW 2012: 153-164 - [i30]Jaideep Ray, Ali Pinar, C. Seshadhri:
Are we there yet? When to stop a Markov chain while generating random graphs. CoRR abs/1202.3473 (2012) - [i29]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Fast Triangle Counting through Wedge Sampling. CoRR abs/1202.5230 (2012) - [i28]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-wise Maxima. CoRR abs/1204.0824 (2012) - [i27]Deeparnab Chakrabarty, C. Seshadhri:
Optimal bounds for monotonicity and Lipschitz testing over the hypercube. CoRR abs/1204.0849 (2012) - [i26]Michael E. Saks, C. Seshadhri:
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. CoRR abs/1204.1098 (2012) - [i25]Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Degree Relations of Triangles in Real-world Networks and Models. CoRR abs/1207.7125 (2012) - [i24]Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
A scalable directed graph model with reciprocal edges. CoRR abs/1210.5288 (2012) - [i23]Jaideep Ray, Ali Pinar, C. Seshadhri:
A stopping criterion for Markov chains when generating independent random graphs. CoRR abs/1210.8184 (2012) - [i22]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls. CoRR abs/1211.0952 (2012) - [i21]Madhav Jha, C. Seshadhri, Ali Pinar:
From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting. CoRR abs/1212.2264 (2012) - [i20]Deeparnab Chakrabarty, C. Seshadhri:
Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Electron. Colloquium Comput. Complex. TR12 (2012) - [i19]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j8]Bernard Chazelle, C. Seshadhri:
Online geometric reconstruction. J. ACM 58(4): 14:1-14:32 (2011) - [j7]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. 40(1): 200-224 (2011) - [j6]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) - [j5]Satyen Kale, C. Seshadhri:
An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. 40(3): 709-720 (2011) - [c18]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
An In-depth Study of Stochastic Kronecker Graphs. ICDM 2011: 587-596 - [c17]C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? ICS 2011: 195-210 - [c16]Satyen Kale, C. Seshadhri:
Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388 - [c15]Nitin Saxena, C. Seshadhri:
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC 2011: 431-440 - [i18]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. CoRR abs/1102.5046 (2011) - [i17]C. Seshadhri, Yevgeniy Vorobeychik, Jackson R. Mayo, Robert C. Armstrong, Joseph R. Ruthruff:
Influence and Dynamic Behavior in Random Boolean Networks. CoRR abs/1107.3792 (2011) - [i16]Ali Pinar, C. Seshadhri, Tamara G. Kolda:
The Similarity between Stochastic Kronecker and Chung-Lu Graph Models. CoRR abs/1110.4925 (2011) - [i15]David F. Gleich, C. Seshadhri:
Neighborhoods are good communities. CoRR abs/1112.0031 (2011) - [i14]C. Seshadhri, Tamara G. Kolda, Ali Pinar:
Community structure and scale-free collections of Erdös-Rényi graphs. CoRR abs/1112.3644 (2011) - 2010
- [j4]Michael E. Saks, C. Seshadhri:
Local Monotonicity Reconstruction. SIAM J. Comput. 39(7): 2897-2926 (2010) - [c14]Nitin Saxena, C. Seshadhri:
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS 2010: 21-29 - [c13]Michael E. Saks, C. Seshadhri:
Estimating the Longest Increasing Sequence in Polylogarithmic Time. FOCS 2010: 458-467 - [c12]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Convex Hulls. SODA 2010: 1546-1565 - [p1]Michael E. Saks, C. Seshadhri:
Local Property Reconstruction and Monotonicity. Property Testing 2010: 346-354 - [i13]Nitin Saxena, C. Seshadhri:
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. CoRR abs/1002.0145 (2010) - [i12]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010) - [i11]C. Seshadhri, Jan Vondrák:
Is submodularity testable? CoRR abs/1008.0831 (2010) - [i10]Satyen Kale, C. Seshadhri:
Combinatorial Approximation Algorithms for MaxCut using Random Walks. CoRR abs/1008.3938 (2010) - [i9]Nitin Saxena, C. Seshadhri:
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. CoRR abs/1011.3234 (2010) - [i8]Nitin Saxena, C. Seshadhri:
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Nitin Saxena, C. Seshadhri:
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c11]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. CCC 2009: 137-148 - [c10]Elad Hazan, C. Seshadhri:
Efficient learning algorithms for changing environments. ICML 2009: 393-400 - [i6]C. Seshadhri:
Testing cycle-freeness: Finding a certificate. CoRR abs/0906.5010 (2009) - [i5]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. CoRR abs/0907.0884 (2009) - 2008
- [j3]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008) - [c9]Kenneth L. Clarkson, C. Seshadhri:
Self-improving algorithms for delaunay triangulations. SCG 2008: 148-155 - [c8]Satyen Kale, Yuval Peres, C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728 - [c7]Satyen Kale, C. Seshadhri:
An Expansion Tester for Bounded Degree Graphs. ICALP (1) 2008: 527-538 - [c6]Michael E. Saks, C. Seshadhri:
Parallel monotonicity reconstruction. SODA 2008: 962-971 - [i4]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. CoRR abs/0811.3161 (2008) - [i3]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j2]Seshadhri Comandur, Anil Seth, Somenath Biswas:
RAM Simulation of BGS Model of Abstract-state Machines. Fundam. Informaticae 77(1-2): 175-185 (2007) - [j1]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007) - [i2]Elad Hazan, C. Seshadhri:
Adaptive Algorithms for Online Decision Problems. Electron. Colloquium Comput. Complex. TR07 (2007) - [i1]Satyen Kale, C. Seshadhri:
Testing Expansion in Bounded Degree Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c5]Bernard Chazelle, C. Seshadhri:
Online geometric reconstruction. SCG 2006: 386-394 - [c4]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Self-improving algorithms. SODA 2006: 261-270 - 2005
- [c3]Seshadhri Comandur, Anil Seth, Somenath Biswas:
RAM Simulation of BGS Model of Abstract State Machines. Abstract State Machines 2005: 377-386 - 2004
- [c2]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236 - [c1]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. ISAAC 2004: 16-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
