C. Seshadhri - RankMe

238 papers A* 51A 18B 1C 1Misc 1Journal 155Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A note on approximating the average degree of bounded arboricity graphs. CoRR Talya Eden, C. Seshadhri
2026	J	`jnl`	Counting hypertriangles through hypergraph orientations. CoRR Daniel Paul-Pena, Vaishali Surianarayanan, Deeparnab Chakrabarty, C. Seshadhri
2026	A*	`conf`	Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. SODA Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri
2026	A*	`conf`	Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. SODA Daniel Paul-Pena, C. Seshadhri
2025	A*	`conf`	A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs. SODA Daniel Paul-Pena, C. Seshadhri
2025	A	`conf`	A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. WSDM Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2025	A	`conf`	Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. ITCS Deeparnab Chakrabarty, C. Seshadhri
2025	J	`jnl`	Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. CoRR Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri
2025	A*	`conf`	Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. STOC Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten
2025	J	`jnl`	Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. CoRR Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten
2025	J	`jnl`	Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. CoRR Daniel Paul-Pena, C. Seshadhri
2025	A*	`conf`	Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs. ICALP Daniel Paul-Pena, C. Seshadhri
2025	J	`jnl`	TIMEST: Temporal Information Motif Estimator Using Sampling Trees. CoRR Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati
2025	J	`jnl`	TIMEST: Temporal Information Motif Estimator Using Sampling Trees. Proc. VLDB Endow. Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati
2025	J	`jnl`	Triadic First-Order Logic Queries in Temporal Networks. CoRR Omkar Bhalerao, Yunjie Pan, C. Seshadhri, Nishil Talati
2024	B	`conf`	A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. ISAAC Daniel Paul-Pena, C. Seshadhri
2024	J	`jnl`	A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2024	A*	`conf`	Accurate and Fast Estimation of Temporal Motifs Using Path Sampling. ICDM Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati
2024	J	`jnl`	Accurate and Fast Estimation of Temporal Motifs using Path Sampling. CoRR Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati
2024	A*	`conf`	Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC Quanquan C. Liu, C. Seshadhri
2024	A	`conf`	Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets. CIKM Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024	J	`jnl`	Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets. CoRR Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024	J	`jnl`	Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. CoRR Deeparnab Chakrabarty, C. Seshadhri
2024	J	`jnl`	Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR Quanquan C. Liu, C. Seshadhri
2024	J	`jnl`	Spectral Triadic Decompositions of Real-World Networks. SIAM J. Math. Data Sci. Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2024	J	`jnl`	Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs. CoRR Daniel Paul-Pena, C. Seshadhri
2023	J	`jnl`	A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs. CoRR Daniel Paul-Pena, C. Seshadhri
2023	A*	`conf`	A d FOCS Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	A d CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	A d Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	A*	`conf`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	Limitations of low dimensional graph embeddings. IEEE Data Eng. Bull. C. Seshadhri
2023	J	`jnl`	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. Akash Kumar, C. Seshadhri, Andrew Stolman
2023	A	`conf`	Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). ICDT C. Seshadhri
2023	A*	`conf`	Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming. ICML Yufan Huang, C. Seshadhri, David F. Gleich
2022	J	`jnl`	A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. CoRR Daniel Paul-Pena, C. Seshadhri
2022	A	`conf`	Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma
2022	J	`jnl`	Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma
2022	J	`jnl`	Counting Subgraphs in Degenerate Graphs. J. ACM Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
2022	J	`jnl`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester. Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2022	J	`jnl`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2022	A	`conf`	FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri
2022	J	`jnl`	Spectral Triadic Decompositions of Real-World Networks. CoRR Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2022	A*	`conf`	The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021	A*	`conf`	Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. KDD Noujan Pashanasangi, C. Seshadhri
2021	J	`jnl`	Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. CoRR Noujan Pashanasangi, C. Seshadhri
2021	A*	`conf`	Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. SODA Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2021	A*	`conf`	Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS Akash Kumar, C. Seshadhri, Andrew Stolman
2021	J	`jnl`	Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2021	J	`jnl`	Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2021	J	`jnl`	Randomized Algorithms for Scientific Computing (RASC). CoRR 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
2021	J	`jnl`	The complexity of testing all properties of planar graphs, and the role of isomorphism. CoRR Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021	J	`jnl`	The complexity of testing all properties of planar graphs, and the role of isomorphism. Electron. Colloquium Comput. Complex. Sabyasachi Basu, Akash Kumar, C. Seshadhri
2020	—	`ch.`	Distribution-Free Models of Social Networks. Beyond the Worst-Case Analysis of Algorithms Tim Roughgarden, C. Seshadhri
2020	J	`jnl`	Distribution-Free Models of Social Networks. CoRR Tim Roughgarden, C. Seshadhri
2020	A*	`conf`	Domain Reduction for Monotonicity Testing: A SODA Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2020	A	`conf`	Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. WSDM Noujan Pashanasangi, C. Seshadhri
2020	A*	`conf`	Faster sublinear approximation of the number of SODA Talya Eden, Dana Ron, C. Seshadhri
2020	J	`jnl`	Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2020	A*	`conf`	How the Degeneracy Helps for Triangle Counting in Graph Streams. PODS Suman K. Bera, C. Seshadhri
2020	J	`jnl`	How the Degeneracy Helps for Triangle Counting in Graph Streams. CoRR Suman K. Bera, C. Seshadhri
2020	A*	`conf`	How to Count Triangles, without Seeing the Whole Graph. KDD Suman K. Bera, C. Seshadhri
2020	J	`jnl`	How to Count Triangles, without Seeing the Whole Graph. CoRR Suman K. Bera, C. Seshadhri
2020	A	`conf`	Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2020	J	`jnl`	Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. CoRR Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2020	J	`jnl`	On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. Talya Eden, Dana Ron, C. Seshadhri
2020	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Theory Comput. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2020	A*	`conf`	Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. WWW Shweta Jain, C. Seshadhri
2020	J	`jnl`	Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. CoRR Shweta Jain, C. Seshadhri
2020	—	`ch.`	Self-Improving Algorithms. Beyond the Worst-Case Analysis of Algorithms C. Seshadhri
2020	A	`conf`	The Power of Pivoting for Exact Clique Counting. WSDM Shweta Jain, C. Seshadhri
2020	J	`jnl`	The Power of Pivoting for Exact Clique Counting. CoRR Shweta Jain, C. Seshadhri
2020	J	`jnl`	The impossibility of low rank representations for triangle-rich complex networks. CoRR C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
2020	J	`jnl`	The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. USA C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
2019	A	`conf`	Adaptive Boolean Monotonicity Testing in Total Influence Time. ITCS Deeparnab Chakrabarty, C. Seshadhri
2019	J	`jnl`	Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. CoRR Noujan Pashanasangi, C. Seshadhri
2019	J	`jnl`	Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. CoRR Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2019	J	`jnl`	Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs. SIAM J. Comput. Akash Kumar, C. Seshadhri, Andrew Stolman
2019	J	`jnl`	Random walks and forbidden minors II: A poly(dε CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2019	A*	`conf`	Random walks and forbidden minors II: a poly( STOC Akash Kumar, C. Seshadhri, Andrew Stolman
2019	J	`jnl`	Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. Talya Eden, Dana Ron, C. Seshadhri
2019	J	`jnl`	andom walks and forbidden minors II: A poly(dε Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2018	A*	`conf`	A SODA Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Adaptive Boolean Monotonicity Testing in Total Influence Time. CoRR Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Adaptive Boolean Monotonicity Testing in Total Influence Time. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids. Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR Talya Eden, Dana Ron, C. Seshadhri
2018	J	`jnl`	Fiding forbidden minors in sublinear time: a O(n CoRR Akash Kumar, C. Seshadhri, Andrew Stolman
2018	A*	`conf`	Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018	J	`jnl`	Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018	A*	`conf`	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 Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Finding forbidden minors in sublinear time: a O(n Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Finding forbidden minors in sublinear time: a n Electron. Colloquium Comput. Complex. Akash Kumar, C. Seshadhri, Andrew Stolman
2018	J	`jnl`	Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2018	A*	`conf`	On approximating the number of k-cliques in sublinear time. STOC Talya Eden, Dana Ron, C. Seshadhri
2018	A*	`conf`	Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
2017	J	`jnl`	A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n] CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2017	A*	`conf`	A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. WWW Shweta Jain, C. Seshadhri
2017	J	`jnl`	A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. CoRR Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. Electron. Colloquium Comput. Complex. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n] Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2017	A*	`conf`	Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance. SODA Timothy Naumovitz, Michael E. Saks, C. Seshadhri
2017	J	`jnl`	Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
2017	J	`jnl`	Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. Benjamin Raichel, C. Seshadhri
2017	J	`jnl`	Directed closure measures for networks with reciprocity. J. Complex Networks C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2017	A*	`conf`	ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. WWW Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
2017	J	`jnl`	Estimating the Longest Increasing Sequence in Polylogarithmic Time. SIAM J. Comput. Michael E. Saks, C. Seshadhri
2017	J	`jnl`	Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2017	J	`jnl`	On Approximating the Number of $k$-cliques in Sublinear Time. CoRR Talya Eden, Dana Ron, C. Seshadhri
2017	A*	`conf`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. ICALP Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. CoRR Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Electron. Colloquium Comput. Complex. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2017	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. ACM Trans. Algorithms Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2017	J	`jnl`	Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
2017	A*	`conf`	Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP Talya Eden, Dana Ron, C. Seshadhri
2017	A*	`conf`	When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. WWW Aneesh Sharma, C. Seshadhri, Ashish Goel
2017	J	`jnl`	When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. CoRR Aneesh Sharma, C. Seshadhri, Ashish Goel
2016	J	`jnl`	A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. CoRR Deeparnab Chakrabarty, C. Seshadhri
2016	J	`jnl`	A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. CoRR Shweta Jain, C. Seshadhri
2016	J	`jnl`	A Õ(n) Non-Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2016	J	`jnl`	An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput. Deeparnab Chakrabarty, C. Seshadhri
2016	A*	`conf`	Avoiding the Global Sort: A Faster Contour Tree Algorithm. SoCG Benjamin Raichel, C. Seshadhri
2016	J	`jnl`	Decompositions of Triangle-Dense Graphs. SIAM J. Comput. Rishi Gupta, Tim Roughgarden, C. Seshadhri
2016	J	`jnl`	ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. CoRR Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
2016	J	`jnl`	Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR Talya Eden, Dana Ron, C. Seshadhri
2016	J	`jnl`	Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling. SIAM J. Sci. Comput. Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, Ali Pinar, Maher Salloum, C. Seshadhri
2015	J	`jnl`	A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox. ACM Trans. Knowl. Discov. Data Madhav Jha, C. Seshadhri, Ali Pinar
2015	J	`jnl`	A simpler sublinear algorithm for approximating the triangle count. CoRR C. Seshadhri
2015	J	`jnl`	A stopping criterion for Markov chains when generating independent random graphs. J. Complex Networks Jaideep Ray, Ali Pinar, C. Seshadhri
2015	A*	`conf`	Approximately Counting Triangles in Sublinear Time. FOCS Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
2015	A*	`conf`	Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution. ICDM Olivia Simpson, C. Seshadhri, Andrew McGregor
2015	J	`jnl`	Catching the head, the tail, and everything in between: a streaming algorithm for the degree distribution. CoRR Olivia Simpson, C. Seshadhri, Andrew McGregor
2015	Misc	`conf`	Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC Madhav Jha, Ali Pinar, C. Seshadhri
2015	A*	`conf`	Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. ICDM Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2015	J	`jnl`	Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search. CoRR Grey Ballard, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2015	A*	`conf`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2015	A*	`conf`	Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW Madhav Jha, C. Seshadhri, Ali Pinar
2015	A*	`conf`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. SODA Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2015	—	`ch.`	Sublinear Algorithms for Extreme-Scale Data Analysis. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces C. Seshadhri, Ali Pinar, David C. Thompson, Janine C. Bennett
2015	J	`jnl`	Trigger detection for adaptive scientific workflows using percentile sampling. CoRR Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, C. Seshadhri, Ali Pinar, Maher Salloum
2015	J	`jnl`	Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? Internet Math. Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson
2014	J	`jnl`	A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm. CoRR Benjamin Raichel, C. Seshadhri
2014	J	`jnl`	A Scalable Generative Graph Model with Community Structure. SIAM J. Sci. Comput. Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri
2014	J	`jnl`	An Optimal Lower Bound for Monotonicity Testing over Hypergrids. Theory Comput. Deeparnab Chakrabarty, C. Seshadhri
2014	J	`jnl`	Characterizing short-term stability for Boolean networks over any distribution of transfer functions. CoRR C. Seshadhri, Andrew M. Smith, Yevgeniy Vorobeychik, Jackson R. Mayo, Robert C. Armstrong
2014	J	`jnl`	Counting Triangles in Massive Graphs with MapReduce. SIAM J. Sci. Comput. Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task
2014	A	`conf`	Decompositions of triangle-dense graphs. ITCS Rishi Gupta, Tim Roughgarden, C. Seshadhri
2014	J	`jnl`	FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. CoRR Peter Lofgren, Siddhartha Banerjee, Ashish Goel, C. Seshadhri
2014	J	`jnl`	Finding cycles and trees in sublinear time. Random Struct. Algorithms Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2014	J	`jnl`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2014	J	`jnl`	Is Submodularity Testable? Algorithmica C. Seshadhri, Jan Vondrák
2014	J	`jnl`	Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2014	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. CoRR Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2014	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2014	J	`jnl`	Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2014	J	`jnl`	Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. C. Seshadhri, Ali Pinar, Tamara G. Kolda
2014	A	`conf`	Why do simple algorithms for triangle enumeration work in the real world? ITCS Jonathan W. Berry, Luke K. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson
2014	J	`jnl`	Why do simple algorithms for triangle enumeration work in the real world? CoRR Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson
2013	J	`jnl`	A Scalable Generative Graph Model with Community Structure CoRR Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri
2013	J	`jnl`	A o(n) monotonicity tester for Boolean functions over the hypercube CoRR Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	A o(n) monotonicity tester for Boolean functions over the hypercube. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2013	A*	`conf`	A o(n) monotonicity tester for boolean functions over the hypercube. STOC Deeparnab Chakrabarty, C. Seshadhri
2013	—	`conf`	A provably-robust sampling method for generating colormaps of large data. LDAV David C. Thompson, Janine Bennett, C. Seshadhri, Ali Pinar
2013	—	`conf`	A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal. NSW Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2013	A*	`conf`	A space efficient streaming algorithm for triangle counting using the birthday paradox. KDD Madhav Jha, C. Seshadhri, Ali Pinar
2013	—	`conf`	An Optimal Lower Bound for Monotonicity Testing over Hypergrids. APPROX-RANDOM Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	An in-depth analysis of stochastic Kronecker graphs. J. ACM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2013	J	`jnl`	An optimal lower bound for monotonicity testing over hypergrids CoRR Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	An optimal lower bound for monotonicity testing over hypergrids. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	Counting Triangles in Massive Graphs with MapReduce CoRR Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task
2013	J	`jnl`	Decompositions of Triangle-Dense Graphs. CoRR Rishi Gupta, Tim Roughgarden, C. Seshadhri
2013	J	`jnl`	Estimating the longest increasing sequence in polylogarithmic time. CoRR Michael E. Saks, C. Seshadhri
2013	J	`jnl`	From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. J. ACM Nitin Saxena, C. Seshadhri
2013	J	`jnl`	Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. SIAM J. Comput. Satyen Kale, Yuval Peres, C. Seshadhri
2013	A*	`conf`	Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. STOC Deeparnab Chakrabarty, C. Seshadhri
2013	A*	`conf`	Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. SODA Michael E. Saks, C. Seshadhri
2013	J	`jnl`	The importance of directed triangles with reciprocity: patterns and algorithms CoRR C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2013	A	`conf`	Triadic Measures on Graphs: The Power of Wedge Sampling. SDM Tamara G. Kolda, Ali Pinar, C. Seshadhri
2013	J	`jnl`	Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs. CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2013	J	`jnl`	When a Graph is not so Simple: Counting Triangles in Multigraph Streams. CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2012	J	`jnl`	A scalable directed graph model with reciprocal edges CoRR Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2012	J	`jnl`	A stopping criterion for Markov chains when generating independent random graphs CoRR Jaideep Ray, Ali Pinar, C. Seshadhri
2012	C	`conf`	Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. WAW Jaideep Ray, Ali Pinar, C. Seshadhri
2012	J	`jnl`	Are we there yet? When to stop a Markov chain while generating random graphs CoRR Jaideep Ray, Ali Pinar, C. Seshadhri
2012	J	`jnl`	Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. SIAM J. Comput. Nitin Saxena, C. Seshadhri
2012	J	`jnl`	Degree Relations of Triangles in Real-world Networks and Models CoRR Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2012	A	`conf`	Degree relations of triangles in real-world networks and graph models. CIKM Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2012	J	`jnl`	Fast Triangle Counting through Wedge Sampling CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2012	J	`jnl`	Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2012	J	`jnl`	From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2012	J	`jnl`	Optimal bounds for monotonicity and Lipschitz testing over the hypercube CoRR Deeparnab Chakrabarty, C. Seshadhri
2012	J	`jnl`	Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2012	J	`jnl`	Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls CoRR Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	J	`jnl`	Self-improving Algorithms for Coordinate-wise Maxima CoRR Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	—	`conf`	Self-improving algorithms for coordinate-wise maxima. SCG Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	J	`jnl`	Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance CoRR Michael E. Saks, C. Seshadhri
2012	A	`conf`	The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. SDM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2012	A*	`conf`	Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. KDD David F. Gleich, C. Seshadhri
2011	J	`jnl`	A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2011	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. Nitin Saxena, C. Seshadhri
2011	J	`jnl`	An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. Satyen Kale, C. Seshadhri
2011	A*	`conf`	An In-depth Study of Stochastic Kronecker Graphs. ICDM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2011	A*	`conf`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC Nitin Saxena, C. Seshadhri
2011	A	`conf`	Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS Satyen Kale, C. Seshadhri
2011	J	`jnl`	Community structure and scale-free collections of Erdös-Rényi graphs CoRR C. Seshadhri, Tamara G. Kolda, Ali Pinar
2011	J	`jnl`	Influence and Dynamic Behavior in Random Boolean Networks CoRR C. Seshadhri, Yevgeniy Vorobeychik, Jackson R. Mayo, Robert C. Armstrong, Joseph R. Ruthruff
2011	A	`conf`	Is Submodularity Testable? ICS C. Seshadhri, Jan Vondrák
2011	J	`jnl`	Neighborhoods are good communities CoRR David F. Gleich, C. Seshadhri
2011	J	`jnl`	Online geometric reconstruction. J. ACM Bernard Chazelle, C. Seshadhri
2011	J	`jnl`	Self-Improving Algorithms. SIAM J. Comput. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2011	J	`jnl`	The Similarity between Stochastic Kronecker and Chung-Lu Graph Models CoRR Ali Pinar, C. Seshadhri, Tamara G. Kolda
2010	J	`jnl`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter CoRR Nitin Saxena, C. Seshadhri
2010	J	`jnl`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2010	J	`jnl`	Combinatorial Approximation Algorithms for MaxCut using Random Walks CoRR Satyen Kale, C. Seshadhri
2010	A*	`conf`	Estimating the Longest Increasing Sequence in Polylogarithmic Time. FOCS Michael E. Saks, C. Seshadhri
2010	J	`jnl`	Finding Cycles and Trees in Sublinear Time CoRR Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2010	A*	`conf`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS Nitin Saxena, C. Seshadhri
2010	J	`jnl`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits CoRR Nitin Saxena, C. Seshadhri
2010	J	`jnl`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2010	J	`jnl`	Is submodularity testable? CoRR C. Seshadhri, Jan Vondrák
2010	J	`jnl`	Local Monotonicity Reconstruction. SIAM J. Comput. Michael E. Saks, C. Seshadhri
2010	—	`ch.`	Local Property Reconstruction and Monotonicity. Property Testing Michael E. Saks, C. Seshadhri
2010	A*	`conf`	Self-improving Algorithms for Convex Hulls. SODA Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2009	A	`conf`	An Almost Optimal Rank Bound for Depth-3 Identities. CCC Nitin Saxena, C. Seshadhri
2009	A*	`conf`	Efficient learning algorithms for changing environments. ICML Elad Hazan, C. Seshadhri
2009	J	`jnl`	Self-Improving Algorithms CoRR Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2009	J	`jnl`	Testing cycle-freeness: Finding a certificate CoRR C. Seshadhri
2008	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities CoRR Nitin Saxena, C. Seshadhri
2008	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2008	—	`conf`	An Expansion Tester for Bounded Degree Graphs. ICALP (1) Satyen Kale, C. Seshadhri
2008	A*	`conf`	Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS Satyen Kale, Yuval Peres, C. Seshadhri
2008	A*	`conf`	Parallel monotonicity reconstruction. SODA Michael E. Saks, C. Seshadhri
2008	—	`conf`	Self-improving algorithms for delaunay triangulations. SCG Kenneth L. Clarkson, C. Seshadhri
2007	J	`jnl`	Adaptive Algorithms for Online Decision Problems. Electron. Colloquium Comput. Complex. Elad Hazan, C. Seshadhri
2007	J	`jnl`	Testing Expansion in Bounded Degree Graphs. Electron. Colloquium Comput. Complex. Satyen Kale, C. Seshadhri
2006	—	`conf`	Online geometric reconstruction. SCG Bernard Chazelle, C. Seshadhri