C. Seshadhri

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 21

Top Topics

Graph Embedding

Prime Implicants

Boolean Functions

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Quanquan C. Liu, C. Seshadhri
Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR (2024)
Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR (2024)
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 (2024)
Quanquan C. Liu, C. Seshadhri
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC (2024)
Yufan Huang, C. Seshadhri, David F. Gleich
Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming. ICML (2023)
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) (2023)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids. Electron. Colloquium Comput. Complex. (2023)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. FOCS (2023)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. CoRR (2023)
Daniel Paul-Pena, C. Seshadhri
A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs. CoRR (2023)
C. Seshadhri
Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). ICDT (2023)
C. Seshadhri
Limitations of low dimensional graph embeddings. IEEE Data Eng. Bull. 46 (2) (2023)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC (2023)
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR (2022)
Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
Spectral Triadic Decompositions of Real-World Networks. CoRR (2022)
Daniel Paul-Pena, C. Seshadhri
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. CoRR (2022)
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. (2022)
Sabyasachi Basu, Akash Kumar, C. Seshadhri
The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA (2022)
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
Counting Subgraphs in Degenerate Graphs. J. ACM 69 (3) (2022)
Andrew Stolman, Caleb Levy, C. Seshadhri, Aneesh Sharma
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM (2022)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS (2021)