• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 241 matches

• 2024
• 
  Quanquan C. Liu, C. Seshadhri:
  Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC 2024: 519-522
• 
  Quanquan C. Liu, C. Seshadhri:
  Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR abs/2405.00262 (2024)
• 
  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)
• 
  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
• 
  Benjamin Raichel, Seshadhri Comandur:
  Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 69(1): 1-3 (2023)
• 
  C. Seshadhri:
  Limitations of low dimensional graph embeddings. IEEE Data Eng. Bull. 46(2): 96-107 (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): S18-216 (2023)
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. FOCS 2023: 1796-1821
• 
  C. Seshadhri:
  Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). ICDT 2023: 3:1-3:10
• 
  Yufan Huang, C. Seshadhri, David F. Gleich:
  Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming. ICML 2023: 13976-13992
• 
  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
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. CoRR abs/2304.01416 (2023)
• 
  Daniel Paul-Pena, C. Seshadhri:
  A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs. CoRR abs/2311.09584 (2023)
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  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)
• 
  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
• 
  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
• 
  Sabyasachi Basu, Akash Kumar, C. Seshadhri:
  The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA 2022: 1702-1714
• 
  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)
• 
  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)
• 
  Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri:
  Spectral Triadic Decompositions of Real-World Networks. CoRR abs/2211.06352 (2022)
• 
  Daniel Paul-Pena, C. Seshadhri:
  A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. CoRR abs/2211.08605 (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. TR22 (2022)
• 2021
• 
  Lakshmi Chandrasekaran, Karuppusamy Thenmozhi, C. Venkatesan, A. Seshadhri, John Bosco Balaguru Rayappan, Rengarajan Amirtharajan:
  Mutated Cleavages of Images for Stealth Disclosure: A Hopfield Neural Network Attractor (HNNA) Approach. Neural Process. Lett. 53(2): 907-928 (2021)
• 
  Yu Yang, Seshadhri Srinivasan, Guoqiang Hu, Costas J. Spanos:
  Distributed Control of Multizone HVAC Systems Considering Indoor Air Quality. IEEE Trans. Control. Syst. Technol. 29(6): 2586-2597 (2021)
• 
  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
• 
  Noujan Pashanasangi, C. Seshadhri:
  Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. KDD 2021: 1319-1328
• 
  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
• 
  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)
• 
  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)

skipping 211 more matches