2025

  • Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
    Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, and Erik Waingarten.
    Symposium on Theory of Computing (STOC) 2025 https://arxiv.org/abs/2502.16355
  • Welfare Approximation in Additively Separable Hedonic Games
    Martin Bullinger, Vaggos Chatziafratis, Parnian Shahkar
    International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2025
  • A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
    Sabyasachi Basu, Nadia Kōshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
    WSDM 2025, https://arxiv.org/abs/2406.08624
  • A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs
    Daniel Paul-Pena and C. Seshadhri
    Symposium on Discrete Algorithms (SODA) 2025, https://arxiv.org/abs/2311.09584
  • Potential Hessian Ascent: The Sherrington-Kirkpatrick Model
    David Jekel, Juspreet Singh Sandhu, Jonathan Shi
    Symposium on Discrete Algorithms (SODA) 2025, https://arxiv.org/abs/2408.02360
  • Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
    Deeparnab Chakrabarty and C. Seshadhri
    Innovations in Theoretical Computer Science (ITCS) 2025, https://www.arxiv.org/abs/2409.02206

2024

  • Embedding Dimension of Contrastive Learning and k-Nearest Neighbors
    Dmitrii Avdiukhin, Vaggos Chatziafratis, Orr Fischer, Grigory Yaroslavtsev
    Conference on Neural Information Processing Systems (NeurIPS) 2024  ihttps://openreview.net/pdf?id=H0qu4moFly
  • A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
    Daniel Paul-Pena and C. Seshadhri
    International Symposium on Algorithms and Computation (ISAAC) 2024, https://arxiv.org/abs/2211.08605
  • Accurate and Fast Estimation of Temporal Motifs using Path Sampling
    Yunjie Pan, Omkar Bhalerao, Nishil Talati, and C. Seshadhri  
    International Conference on Data Mining (ICDM) 2024, https://arxiv.org/abs/2409.08975
  • Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
    Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, and Karthik Subbian
    Conference on Information and Knowledge Management (CIKM) 2024, https://arxiv.org/abs/2407.16850

(Publications before 2024 are not shown here)