Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing - Deeparnab Chakrabarty; C. Seshadhri (16th Innovations in Theoretical Computer Science Conference, ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA, 2025)

A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs - Daniel Paul-Pena; C. Seshadhri (Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, 2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks - Sabyasachi Basu; Nadia Koshima; Talya Eden; Omri Ben-Eliezer; C. Seshadhri (Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025, 2025)

Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning - Deeparnab Chakrabarty; Xi Chen; Simeon Ristic; C. Seshadhri; Erik Waingarten (CoRR, 2025)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets - Sabyasachi Basu; Daniel Paul-Pena; Kun Qian; C. Seshadhri; Edward W. Huang; Karthik Subbian (Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024, 2024)

Accurate and Fast Estimation of Temporal Motifs Using Path Sampling - Yunjie Pan; Omkar Bhalerao; C. Seshadhri; Nishil Talati (IEEE International Conference on Data Mining, ICDM 2024, Abu Dhabi, United Arab Emirates, December 9-12, 2024, 2024)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs - Daniel Paul-Pena; C. Seshadhri (35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia, 2024)

Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds - Quanquan C. Liu; C. Seshadhri (Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024, 2024)

Improved Massively Parallel Triangle Counting in O(1) Rounds - Quanquan C. Liu; C. Seshadhri (CoRR, 2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks - Sabyasachi Basu; Nadia Koshima; Talya Eden; Omri Ben-Eliezer; C. Seshadhri (CoRR, 2024)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets - Sabyasachi Basu; Daniel Paul-Pena; Kun Qian; C. Seshadhri; Edward W. Huang; Karthik Subbian (CoRR, 2024)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling - Yunjie Pan; Omkar Bhalerao; C. Seshadhri; Nishil Talati (CoRR, 2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs - Daniel Paul-Pena; C. Seshadhri (CoRR, 2024)

Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm - Benjamin Raichel; Seshadhri Comandur (Discret. Comput. Geom., 2023)

Limitations of low dimensional graph embeddings - C. Seshadhri (IEEE Data Eng. Bull., 2023)

Random Walks and Forbidden Minors I: An n^{1/2+o(1)}-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (SIAM J. Comput., 2023)

A d\(^1/2+o(1)\) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, 2023)

Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk) - C. Seshadhri (26th International Conference on Database Theory, ICDT 2023, March 28-31, 2023, Ioannina, Greece, 2023)

Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming - Yufan Huang; C. Seshadhri; David F. Gleich (International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA, 2023)

Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n\(\)d) Monotonicity Tester - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, 2023)

A d\(^1/2+o(1)\) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2023)

A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs - Daniel Paul-Pena; C. Seshadhri (CoRR, 2023)

A d\(^1/2+o(1)\) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2023)

Counting Subgraphs in Degenerate Graphs - Suman K. Bera; Lior Gishboliner; Yevgeny Levanzov; C. Seshadhri; Asaf Shapira (J. ACM, 2022)

FPT Algorithms for Finding Near-Cliques in c-Closed Graphs - Balaram Behera; Edin Husic; Shweta Jain; Tim Roughgarden; C. Seshadhri (13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, 2022)

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling - Andrew Stolman; Caleb C. Levy; C. Seshadhri; Aneesh Sharma (Proceedings of the 2022 SIAM International Conference on Data Mining, SDM 2022, Alexandria, VA, USA, April 28-30, 2022, 2022)

The complexity of testing all properties of planar graphs, and the role of isomorphism - Sabyasachi Basu; Akash Kumar; C. Seshadhri (Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, 2022)

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling - Andrew Stolman; Caleb C. Levy; C. Seshadhri; Aneesh Sharma (CoRR, 2022)

Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an O\ (n\(\)d) Monotonicity Tester - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2022)

Spectral Triadic Decompositions of Real-World Networks - Sabyasachi Basu; Suman Kalyan Bera; C. Seshadhri (CoRR, 2022)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs - Daniel Paul-Pena; C. Seshadhri (CoRR, 2022)

Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an \widetilde{O}(n\sqrt{d}) Monotonicity Tester - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2022)

Random walks and forbidden minors III: \text{poly}\left(d\varepsilon ^{-1}\right)-time partition oracles for minor-free graph classes - Akash Kumar; C. Seshadhri; Andrew Stolman (62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, 2021)

Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering - Noujan Pashanasangi; C. Seshadhri (KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, August 14-18, 2021, 2021)

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles - Suman K. Bera; Noujan Pashanasangi; C. Seshadhri (Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, 2021)

Random walks and forbidden minors III: poly(d/\(ε\))-time partition oracles for minor-free graph classes - Akash Kumar; C. Seshadhri; Andrew Stolman (CoRR, 2021)

Randomized Algorithms for Scientific Computing (RASC) - 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; et al. (CoRR, 2021)

Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering - Noujan Pashanasangi; C. Seshadhri (CoRR, 2021)

The complexity of testing all properties of planar graphs, and the role of isomorphism - Sabyasachi Basu; Akash Kumar; C. Seshadhri (CoRR, 2021)

The complexity of testing all properties of planar graphs, and the role of isomorphism - Sabyasachi Basu; Akash Kumar; C. Seshadhri (Electron. Colloquium Comput. Complex., 2021)

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes - Akash Kumar; C. Seshadhri; Andrew Stolman (Electron. Colloquium Comput. Complex., 2021)

The impossibility of low-rank representations for triangle-rich complex networks - C. Seshadhri; Aneesh Sharma; Andrew Stolman; Ashish Goel (Proc. Natl. Acad. Sci. USA, 2020)

Finding Cliques in Social Networks: A New Distribution-Free Model - Jacob Fox; Tim Roughgarden; C. Seshadhri; Fan Wei; Nicole Wein (SIAM J. Comput., 2020)

On Approximating the Number of k-Cliques in Sublinear Time - Talya Eden; Dana Ron; C. Seshadhri (SIAM J. Comput., 2020)

Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (Theory Comput., 2020)

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six - Suman K. Bera; Noujan Pashanasangi; C. Seshadhri (11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, 2020)

How to Count Triangles, without Seeing the Whole Graph - Suman K. Bera; C. Seshadhri (KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23-27, 2020, 2020)

How the Degeneracy Helps for Triangle Counting in Graph Streams - Suman K. Bera; C. Seshadhri (Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, June 14-19, 2020, 2020)

Faster sublinear approximation of the number of k-cliques in low-arboricity graphs - Talya Eden; Dana Ron; C. Seshadhri (Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020)

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020)

The Power of Pivoting for Exact Clique Counting - Shweta Jain; C. Seshadhri (WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020, 2020)

Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE - Noujan Pashanasangi; C. Seshadhri (WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020, 2020)

Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS - Shweta Jain; C. Seshadhri (WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020)

Self-Improving Algorithms - C. Seshadhri (Beyond the Worst-Case Analysis of Algorithms, 2020)

Distribution-Free Models of Social Networks - Tim Roughgarden; C. Seshadhri (Beyond the Worst-Case Analysis of Algorithms, 2020)

The Power of Pivoting for Exact Clique Counting - Shweta Jain; C. Seshadhri (CoRR, 2020)

The impossibility of low rank representations for triangle-rich complex networks - C. Seshadhri; Aneesh Sharma; Andrew Stolman; Ashish Goel (CoRR, 2020)

How the Degeneracy Helps for Triangle Counting in Graph Streams - Suman K. Bera; C. Seshadhri (CoRR, 2020)

How to Count Triangles, without Seeing the Whole Graph - Suman K. Bera; C. Seshadhri (CoRR, 2020)

Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS - Shweta Jain; C. Seshadhri (CoRR, 2020)

Distribution-Free Models of Social Networks - Tim Roughgarden; C. Seshadhri (CoRR, 2020)

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles - Suman K. Bera; Noujan Pashanasangi; C. Seshadhri (CoRR, 2020)

Random Walks and Forbidden Minors II: A \mathrm{poly}(d\varepsilon^{-1})-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (SIAM J. Comput., 2019)

Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection - Talya Eden; Dana Ron; C. Seshadhri (SIAM J. Discret. Math., 2019)

Adaptive Boolean Monotonicity Testing in Total Influence Time - Deeparnab Chakrabarty; C. Seshadhri (10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA, 2019)

Random walks and forbidden minors II: a poly(d \(ε\)\(^-1\))-query tester for minor-closed properties of bounded degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, 2019)

Scalable Subgraph Counting: The Methods Behind The Madness - Seshadhri Comandur; Srikanta Tirthapura (Companion of The 2019 World Wide Web Conference, WWW 2019, San Francisco, CA, USA, May 13-17, 2019, 2019)

Random walks and forbidden minors II: A poly(d\(ε\)\(^-1\))-query tester for minor-closed properties of bounded-degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (CoRR, 2019)

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six - Suman K. Bera; Noujan Pashanasangi; C. Seshadhri (CoRR, 2019)

Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE - Noujan Pashanasangi; C. Seshadhri (CoRR, 2019)

andom walks and forbidden minors II: A poly(d\(ε\)\(^-1\))-query tester for minor-closed properties of bounded degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (Electron. Colloquium Comput. Complex., 2019)

Local Algorithms for Hierarchical Dense Subgraph Discovery - Ahmet Erdem Sariyüce; C. Seshadhri; Ali Pinar (Proc. VLDB Endow., 2018)

Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, 2018)

Finding Cliques in Social Networks: A New Distribution-Free Model - Jacob Fox; Tim Roughgarden; C. Seshadhri; Fan Wei; Nicole Wein (45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018)

A o(d) \(·\) polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]\(^d\) - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, 2018)

On approximating the number of k-cliques in sublinear time - Talya Eden; Dana Ron; C. Seshadhri (Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, 2018)

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples - Talya Eden; Shweta Jain; Ali Pinar; Dana Ron; C. Seshadhri (Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018, 2018)

Adaptive Boolean Monotonicity Testing in Total Influence Time - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2018)

Finding Cliques in Social Networks: A New Distribution-Free Model - Jacob Fox; Tim Roughgarden; C. Seshadhri; Fan Wei; Nicole Wein (CoRR, 2018)

Fiding forbidden minors in sublinear time: a O(n\(^1/2 + o(1)\))-query one-sided tester for minor closed properties on bounded degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (CoRR, 2018)

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2018)

Faster sublinear approximations of k-cliques for low arboricity graphs - Talya Eden; Dana Ron; C. Seshadhri (CoRR, 2018)

Finding forbidden minors in sublinear time: a n\(^1/2+o(1)\)-query one-sided tester for minor closed properties on bounded degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2018)

Adaptive Boolean Monotonicity Testing in Total Influence Time - Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2018)

Finding forbidden minors in sublinear time: a O(n\(^1/2+o(1)\))-query one-sided tester for minor closed properties on bounded degree graphs - Akash Kumar; C. Seshadhri; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Directed closure measures for networks with reciprocity - C. Seshadhri; Ali Pinar; Nurcan Durak; Tamara G. Kolda (J. Complex Networks, 2017)

Avoiding the Global Sort: A Faster Contour Tree Algorithm - Benjamin Raichel; C. Seshadhri (Discret. Comput. Geom., 2017)

Estimating the Longest Increasing Sequence in Polylogarithmic Time - Michael E. Saks; C. Seshadhri (SIAM J. Comput., 2017)

Approximately Counting Triangles in Sublinear Time - Talya Eden; Amit Levi; Dana Ron; C. Seshadhri (SIAM J. Comput., 2017)

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties - Deeparnab Chakrabarty; Kashyap Dixit; Madhav Jha; C. Seshadhri (ACM Trans. Algorithms, 2017)

Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs - Ahmet Erdem Sariyüce; C. Seshadhri; Ali Pinar; Ümit V. Çatalyürek (ACM Trans. Web, 2017)

Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, 2017)

Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection - Talya Eden; Dana Ron; C. Seshadhri (44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, 2017)

Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance - Timothy Naumovitz; Michael E. Saks; C. Seshadhri (Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, 2017)

When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors - Aneesh Sharma; C. Seshadhri; Ashish Goel (Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017, 2017)

A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem - Shweta Jain; C. Seshadhri (Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017, 2017)

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs - Ali Pinar; C. Seshadhri; Vaidyanathan Vishal (Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017, 2017)

When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors - Aneesh Sharma; C. Seshadhri; Ashish Goel (CoRR, 2017)

Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (CoRR, 2017)

Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions - Ahmet Erdem Sariyüce; C. Seshadhri; Ali Pinar (CoRR, 2017)

A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (CoRR, 2017)

On Approximating the Number of k-cliques in Sublinear Time - Talya Eden; Dana Ron; C. Seshadhri (CoRR, 2017)

Provable and practical approximations for the degree distribution using sublinear graph samples - Talya Eden; Shweta Jain; Ali Pinar; Dana Ron; C. Seshadhri (CoRR, 2017)

A o(d) \cdot \text{polylog}~n Monotonicity Tester for Boolean Functions over the Hypergrid [n]\(^d\) - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2017)

Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (Electron. Colloquium Comput. Complex., 2017)

A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube - Roksana Baleshzar; Deeparnab Chakrabarty; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; C. Seshadhri (Electron. Colloquium Comput. Complex., 2017)

A o(d) \(·\) polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]\(^d\) - Hadley Black; Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2017)

Decompositions of Triangle-Dense Graphs - Rishi Gupta; Tim Roughgarden; C. Seshadhri (SIAM J. Comput., 2016)

An o(n) Monotonicity Tester for Boolean Functions over the Hypercube - Deeparnab Chakrabarty; C. Seshadhri (SIAM J. Comput., 2016)

Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling - Janine C. Bennett; Ankit Bhagatwala; Jacqueline H. Chen; Ali Pinar; Maher Salloum; C. Seshadhri (SIAM J. Sci. Comput., 2016)

Avoiding the Global Sort: A Faster Contour Tree Algorithm - Benjamin Raichel; C. Seshadhri (32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, 2016)

Local Reconstruction - Seshadhri Comandur (Encyclopedia of Algorithms, 2016)

Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection - Talya Eden; Dana Ron; C. Seshadhri (CoRR, 2016)

A \widetilde{O}(n) Non-Adaptive Tester for Unateness - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2016)

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs - Ali Pinar; C. Seshadhri; Vaidyanathan Vishal (CoRR, 2016)

A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem - Shweta Jain; C. Seshadhri (CoRR, 2016)

A Õ(n) Non-Adaptive Tester for Unateness - Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2016)

A stopping criterion for Markov chains when generating independent random graphs - Jaideep Ray; Ali Pinar; C. Seshadhri (J. Complex Networks, 2015)

Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? - Jonathan W. Berry; Luke A. Fostvedt; Daniel J. Nordman; Cynthia A. Phillips; C. Seshadhri; Alyson G. Wilson (Internet Math., 2015)

A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox - Madhav Jha; C. Seshadhri; Ali Pinar (ACM Trans. Knowl. Discov. Data, 2015)

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows - Madhav Jha; Ali Pinar; C. Seshadhri (49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, CA, USA, November 8-11, 2015, 2015)

Approximately Counting Triangles in Sublinear Time - Talya Eden; Amit Levi; Dana Ron; C. Seshadhri (IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, 2015)

Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search - Grey Ballard; Tamara G. Kolda; Ali Pinar; C. Seshadhri (2015 IEEE International Conference on Data Mining, ICDM 2015, Atlantic City, NJ, USA, November 14-17, 2015, 2015)

Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution - Olivia Simpson; C. Seshadhri; Andrew McGregor (2015 IEEE International Conference on Data Mining, ICDM 2015, Atlantic City, NJ, USA, November 14-17, 2015, 2015)

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties - Deeparnab Chakrabarty; Kashyap Dixit; Madhav Jha; C. Seshadhri (Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015)

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts - Madhav Jha; C. Seshadhri; Ali Pinar (Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015, 2015)

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions - Ahmet Erdem Sariyüce; C. Seshadhri; Ali Pinar; Ümit V. Çatalyürek (Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015, 2015)

Sublinear Algorithms for Extreme-Scale Data Analysis - C. Seshadhri; Ali Pinar; David C. Thompson; Janine C. Bennett (Green in Software Engineering, 2015)

A simpler sublinear algorithm for approximating the triangle count - C. Seshadhri (CoRR, 2015)

Catching the head, the tail, and everything in between: a streaming algorithm for the degree distribution - Olivia Simpson; C. Seshadhri; Andrew McGregor (CoRR, 2015)

Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search - Grey Ballard; Ali Pinar; Tamara G. Kolda; C. Seshadhri (CoRR, 2015)

Trigger detection for adaptive scientific workflows using percentile sampling - Janine C. Bennett; Ankit Bhagatwala; Jacqueline H. Chen; C. Seshadhri; Ali Pinar; Maher Salloum (CoRR, 2015)

Is Submodularity Testable? - C. Seshadhri; Jan Vondrák (Algorithmica, 2014)

Finding cycles and trees in sublinear time - Artur Czumaj; Oded Goldreich; Dana Ron; C. Seshadhri; Asaf Shapira; Christian Sohler (Random Struct. Algorithms, 2014)

Wedge sampling for computing clustering coefficients and triangle counts on large graphs - C. Seshadhri; Ali Pinar; Tamara G. Kolda (Stat. Anal. Data Min., 2014)

Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri (SIAM J. Comput., 2014)

A Scalable Generative Graph Model with Community Structure - Tamara G. Kolda; Ali Pinar; Todd D. Plantenga; C. Seshadhri (SIAM J. Sci. Comput., 2014)

Counting Triangles in Massive Graphs with MapReduce - Tamara G. Kolda; Ali Pinar; Todd D. Plantenga; C. Seshadhri; Christine Task (SIAM J. Sci. Comput., 2014)

An Optimal Lower Bound for Monotonicity Testing over Hypergrids - Deeparnab Chakrabarty; C. Seshadhri (Theory Comput., 2014)

Why do simple algorithms for triangle enumeration work in the real world? - Jonathan W. Berry; Luke K. Fostvedt; Daniel J. Nordman; Cynthia A. Phillips; C. Seshadhri; Alyson G. Wilson (Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014, 2014)

Decompositions of triangle-dense graphs - Rishi Gupta; Tim Roughgarden; C. Seshadhri (Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014, 2014)

FAST-PPR: scaling personalized pagerank estimation for large graphs - Peter Lofgren; Siddhartha Banerjee; Ashish Goel; Seshadhri Comandur (The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14, New York, NY, USA - August 24 - 27, 2014, 2014)

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties - Deeparnab Chakrabarty; Kashyap Dixit; Madhav Jha; C. Seshadhri (CoRR, 2014)

FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs - Peter Lofgren; Siddhartha Banerjee; Ashish Goel; C. Seshadhri (CoRR, 2014)

Why do simple algorithms for triangle enumeration work in the real world? - Jonathan W. Berry; Luke A. Fostvedt; Daniel J. Nordman; Cynthia A. Phillips; C. Seshadhri; Alyson G. Wilson (CoRR, 2014)

Characterizing short-term stability for Boolean networks over any distribution of transfer functions - C. Seshadhri; Andrew M. Smith; Yevgeniy Vorobeychik; Jackson R. Mayo; Robert C. Armstrong (CoRR, 2014)

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm - Benjamin Raichel; C. Seshadhri (CoRR, 2014)

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions - Ahmet Erdem Sariyüce; C. Seshadhri; Ali Pinar; Ümit V. Çatalyürek (CoRR, 2014)

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts - Madhav Jha; C. Seshadhri; Ali Pinar (CoRR, 2014)

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties - Deeparnab Chakrabarty; Kashyap Dixit; Madhav Jha; C. Seshadhri (Electron. Colloquium Comput. Complex., 2014)

An in-depth analysis of stochastic Kronecker graphs - C. Seshadhri; Ali Pinar; Tamara G. Kolda (J. ACM, 2013)

From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits - Nitin Saxena; C. Seshadhri (J. ACM, 2013)

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction - Satyen Kale; Yuval Peres; C. Seshadhri (SIAM J. Comput., 2013)

An Optimal Lower Bound for Monotonicity Testing over Hypergrids - Deeparnab Chakrabarty; C. Seshadhri (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings, 2013)

A space efficient streaming algorithm for triangle counting using the birthday paradox - Madhav Jha; C. Seshadhri; Ali Pinar (The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, August 11-14, 2013, 2013)

A provably-robust sampling method for generating colormaps of large data - David C. Thompson; Janine Bennett; C. Seshadhri; Ali Pinar (IEEE Symposium on Large-Scale Data Analysis and Visualization, LDAV 2013, 13-14 October, 2013, Atlanta, Georgia, USA, 2013)

A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal - Nurcan Durak; Tamara G. Kolda; Ali Pinar; C. Seshadhri (Proceedings of the 2nd IEEE Network Science Workshop, NSW 2013, April 29 - May 1, 2013, Thayer Hotel, West Point, NY, USA, 2013)

Triadic Measures on Graphs: The Power of Wedge Sampling - Tamara G. Kolda; Ali Pinar; C. Seshadhri (Proceedings of the 13th SIAM International Conference on Data Mining, May 2-4, 2013. Austin, Texas, USA, 2013)

Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance - Michael E. Saks; C. Seshadhri (Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, 2013)

A o(n) monotonicity tester for boolean functions over the hypercube - Deeparnab Chakrabarty; C. Seshadhri (Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, 2013)

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids - Deeparnab Chakrabarty; C. Seshadhri (Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, 2013)

Counting Triangles in Massive Graphs with MapReduce - Tamara G. Kolda; Ali Pinar; Todd D. Plantenga; C. Seshadhri; Christine Task (CoRR, 2013)

A o(n) monotonicity tester for Boolean functions over the hypercube - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2013)

The importance of directed triangles with reciprocity: patterns and algorithms - C. Seshadhri; Ali Pinar; Nurcan Durak; Tamara G. Kolda (CoRR, 2013)

A Scalable Generative Graph Model with Community Structure - Tamara G. Kolda; Ali Pinar; Todd D. Plantenga; C. Seshadhri (CoRR, 2013)

An optimal lower bound for monotonicity testing over hypergrids - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2013)

Estimating the longest increasing sequence in polylogarithmic time - Michael E. Saks; C. Seshadhri (CoRR, 2013)

Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs - C. Seshadhri; Ali Pinar; Tamara G. Kolda (CoRR, 2013)

Decompositions of Triangle-Dense Graphs - Rishi Gupta; Tim Roughgarden; C. Seshadhri (CoRR, 2013)

When a Graph is not so Simple: Counting Triangles in Multigraph Streams - Madhav Jha; C. Seshadhri; Ali Pinar (CoRR, 2013)

A o(n) monotonicity tester for Boolean functions over the hypercube - Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2013)

An optimal lower bound for monotonicity testing over hypergrids - Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2013)

Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter - Nitin Saxena; C. Seshadhri (SIAM J. Comput., 2012)

Degree relations of triangles in real-world networks and graph models - Nurcan Durak; Ali Pinar; Tamara G. Kolda; C. Seshadhri (21st ACM International Conference on Information and Knowledge Management, CIKM'12, Maui, HI, USA, October 29 - November 02, 2012, 2012)

Self-improving algorithms for coordinate-wise maxima - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri (Proceedings of the 28th ACM Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012, 2012)

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods - David F. Gleich; C. Seshadhri (The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '12, Beijing, China, August 12-16, 2012, 2012)

The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models - C. Seshadhri; Ali Pinar; Tamara G. Kolda (Proceedings of the Twelfth SIAM International Conference on Data Mining, Anaheim, California, USA, April 26-28, 2012, 2012)

Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs - Jaideep Ray; Ali Pinar; C. Seshadhri (Algorithms and Models for the Web Graph - 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings, 2012)

Are we there yet? When to stop a Markov chain while generating random graphs - Jaideep Ray; Ali Pinar; C. Seshadhri (CoRR, 2012)

Fast Triangle Counting through Wedge Sampling - C. Seshadhri; Ali Pinar; Tamara G. Kolda (CoRR, 2012)

Self-improving Algorithms for Coordinate-wise Maxima - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri (CoRR, 2012)

Optimal bounds for monotonicity and Lipschitz testing over the hypercube - Deeparnab Chakrabarty; C. Seshadhri (CoRR, 2012)

Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance - Michael E. Saks; C. Seshadhri (CoRR, 2012)

Degree Relations of Triangles in Real-world Networks and Models - Nurcan Durak; Ali Pinar; Tamara G. Kolda; C. Seshadhri (CoRR, 2012)

A scalable directed graph model with reciprocal edges - Nurcan Durak; Tamara G. Kolda; Ali Pinar; C. Seshadhri (CoRR, 2012)

A stopping criterion for Markov chains when generating independent random graphs - Jaideep Ray; Ali Pinar; C. Seshadhri (CoRR, 2012)

Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri (CoRR, 2012)

From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting - Madhav Jha; C. Seshadhri; Ali Pinar (CoRR, 2012)

Optimal bounds for monotonicity and Lipschitz testing over the hypercube - Deeparnab Chakrabarty; C. Seshadhri (Electron. Colloquium Comput. Complex., 2012)

Finding Cycles and Trees in Sublinear Time - Artur Czumaj; Oded Goldreich; Dana Ron; C. Seshadhri; Asaf Shapira; Christian Sohler (Electron. Colloquium Comput. Complex., 2012)

Online geometric reconstruction - Bernard Chazelle; C. Seshadhri (J. ACM, 2011)

An Almost Optimal Rank Bound for Depth-3 Identities - Nitin Saxena; C. Seshadhri (SIAM J. Comput., 2011)

Self-Improving Algorithms - Nir Ailon; Bernard Chazelle; Kenneth L. Clarkson; Ding Liu; Wolfgang Mulzer; C. Seshadhri (SIAM J. Comput., 2011)

An Expansion Tester for Bounded Degree Graphs - Satyen Kale; C. Seshadhri (SIAM J. Comput., 2011)

An In-depth Study of Stochastic Kronecker Graphs - C. Seshadhri; Ali Pinar; Tamara G. Kolda (11th IEEE International Conference on Data Mining, ICDM 2011, Vancouver, BC, Canada, December 11-14, 2011, 2011)

Is Submodularity Testable? - C. Seshadhri; Jan Vondrák (Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings, 2011)

Combinatorial Approximation Algorithms for MaxCut using Random Walks - Satyen Kale; C. Seshadhri (Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings, 2011)

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter - Nitin Saxena; C. Seshadhri (Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, 2011)

A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs - C. Seshadhri; Ali Pinar; Tamara G. Kolda (CoRR, 2011)

Influence and Dynamic Behavior in Random Boolean Networks - C. Seshadhri; Yevgeniy Vorobeychik; Jackson R. Mayo; Robert C. Armstrong; Joseph R. Ruthruff (CoRR, 2011)

The Similarity between Stochastic Kronecker and Chung-Lu Graph Models - Ali Pinar; C. Seshadhri; Tamara G. Kolda (CoRR, 2011)

Neighborhoods are good communities - David F. Gleich; C. Seshadhri (CoRR, 2011)

Community structure and scale-free collections of Erdös-Rényi graphs - C. Seshadhri; Tamara G. Kolda; Ali Pinar (CoRR, 2011)

Local Monotonicity Reconstruction - Michael E. Saks; C. Seshadhri (SIAM J. Comput., 2010)

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits - Nitin Saxena; C. Seshadhri (51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, 2010)

Estimating the Longest Increasing Sequence in Polylogarithmic Time - Michael E. Saks; C. Seshadhri (51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, 2010)

Self-improving Algorithms for Convex Hulls - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri (Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, 2010)

Local Property Reconstruction and Monotonicity - Michael E. Saks; C. Seshadhri (Property Testing - Current Research and Surveys, 2010)

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits - Nitin Saxena; C. Seshadhri (CoRR, 2010)

Finding Cycles and Trees in Sublinear Time - Artur Czumaj; Oded Goldreich; Dana Ron; C. Seshadhri; Asaf Shapira; Christian Sohler (CoRR, 2010)

Is submodularity testable? - C. Seshadhri; Jan Vondrák (CoRR, 2010)

Combinatorial Approximation Algorithms for MaxCut using Random Walks - Satyen Kale; C. Seshadhri (CoRR, 2010)

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter - Nitin Saxena; C. Seshadhri (CoRR, 2010)

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits - Nitin Saxena; C. Seshadhri (Electron. Colloquium Comput. Complex., 2010)

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter - Nitin Saxena; C. Seshadhri (Electron. Colloquium Comput. Complex., 2010)

An Almost Optimal Rank Bound for Depth-3 Identities - Nitin Saxena; C. Seshadhri (Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, 2009)

Efficient learning algorithms for changing environments - Elad Hazan; C. Seshadhri (Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, 2009)

Testing cycle-freeness: Finding a certificate - C. Seshadhri (CoRR, 2009)

Self-Improving Algorithms - Nir Ailon; Bernard Chazelle; Kenneth L. Clarkson; Ding Liu; Wolfgang Mulzer; C. Seshadhri (CoRR, 2009)

Property-Preserving Data Reconstruction - Nir Ailon; Bernard Chazelle; Seshadhri Comandur; Ding Liu (Algorithmica, 2008)

Self-improving algorithms for delaunay triangulations - Kenneth L. Clarkson; C. Seshadhri (Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, 2008)

Noise Tolerance of Expanders and Sublinear Expander Reconstruction - Satyen Kale; Yuval Peres; C. Seshadhri (49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, 2008)

An Expansion Tester for Bounded Degree Graphs - Satyen Kale; C. Seshadhri (Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, 2008)

Parallel monotonicity reconstruction - Michael E. Saks; C. Seshadhri (Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008)

An Almost Optimal Rank Bound for Depth-3 Identities - Nitin Saxena; C. Seshadhri (CoRR, 2008)

An Almost Optimal Rank Bound for Depth-3 Identities - Nitin Saxena; C. Seshadhri (Electron. Colloquium Comput. Complex., 2008)

RAM Simulation of BGS Model of Abstract-state Machines - Seshadhri Comandur; Anil Seth; Somenath Biswas (Fundam. Informaticae, 2007)

Estimating the distance to a monotone function - Nir Ailon; Bernard Chazelle; Seshadhri Comandur; Ding Liu (Random Struct. Algorithms, 2007)

Adaptive Algorithms for Online Decision Problems - Elad Hazan; C. Seshadhri (Electron. Colloquium Comput. Complex., 2007)

Testing Expansion in Bounded Degree Graphs - Satyen Kale; C. Seshadhri (Electron. Colloquium Comput. Complex., 2007)

Online geometric reconstruction - Bernard Chazelle; C. Seshadhri (Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, 2006)

Self-improving algorithms - Nir Ailon; Bernard Chazelle; Seshadhri Comandur; Ding Liu (Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, 2006)

RAM Simulation of BGS Model of Abstract State Machines - Seshadhri Comandur; Anil Seth; Somenath Biswas (Proceedings of the 12th International Workshop on Abstract State Machines, ASM 2005, March 8-11, 2005, Paris, France, 2005)

Estimating the Distance to a Monotone Function - Nir Ailon; Bernard Chazelle; Seshadhri Comandur; Ding Liu (Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, 2004)

Property-Preserving Data Reconstruction - Nir Ailon; Bernard Chazelle; Seshadhri Comandur; Ding Liu (Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, 2004)