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- [i105]Quanquan C. Liu, C. Seshadhri:
Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR abs/2405.00262 (2024) - [i104]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) - [i103]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) - 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]