vix.ing · top · new · best · stats · spec

Seshadhri, C.

  1. Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
    2014/11/18 by Madhav Jha, Jha, Madhav, C. Seshadhri +3 · 5 citations
    Computer Science · Physics and Astronomy · #Advanced Graph Neural Networks #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Network Packet Processing and Optimization #Social and Information Networks (cs.SI)
  2. Finding Cliques in Social Networks: A New Distribution-Free Model
    2018/04/20 by Fox, Jacob, Roughgarden, Tim, Seshadhri, C. +2 · 5 citations
    #05C85 #05D99 #68R10 #68W01 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Social and Information Networks (cs.SI)
  3. Counting Subgraphs in Degenerate Graphs
    2020/10/12 by Suman K. Bera, Bera, Suman K., Lior Gishboliner +7 · 6 citations
    Mathematics · #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods #Stochastic processes and statistical mechanics
  4. A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
    2016/11/17 by Jain, Shweta, Seshadhri, C. · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Social and Information Networks (cs.SI)
  5. Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
    2019/11/14 by Bera, Suman K., Pashanasangi, Noujan, Seshadhri, C. · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  6. A o(n) monotonicity tester for Boolean functions over the hypercube
    2013/02/19 by Chakrabarty, Deeparnab, Seshadhri, C. · 3 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  7. FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs
    2014/04/11 by Lofgren, Peter, Banerjee, Siddhartha, Goel, Ashish +1 · 3 citations
    #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Social and Information Networks (cs.SI)
  8. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
    2016/10/28 by Ali Pınar, Pinar, Ali, C. Seshadhri +3 · 4 citations
    Computer Science · Physics and Astronomy · #Caching and Content Delivery #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI)
  9. How the Degeneracy Helps for Triangle Counting in Graph Streams
    2020/03/29 by Suman K. Bera, Bera, Suman K., C. Seshadhri +1 · 3 citations
    Computer Science · #Caching and Content Delivery #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data
  10. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
    2012/04/04 by Deeparnab Chakrabarty, Chakrabarty, Deeparnab, C. Seshadhri +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning and Algorithms #Stochastic Gradient Optimization Techniques
  11. Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
    2019/11/24 by Noujan Pashanasangi, Pashanasangi, Noujan, C. Seshadhri +1 · 3 citations
    Physics and Astronomy · Mathematics · Computer Science · #Complex Network Analysis Techniques #Graph theory and applications #Topological and Geometric Data Analysis
  12. Provable and practical approximations for the degree distribution using sublinear graph samples
    2017/10/24 by Eden, Talya, Jain, Shweta, Pinar, Ali +2 · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Social and Information Networks (cs.SI) #Statistics Theory (math.ST)
  13. FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
    2020/07/19 by Behera, Balaram, Husić, Edin, Jain, Shweta +2 · 2 citations
    #05C85 #68R10 #68W01 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  14. Is submodularity testable?
    2010/08/04 by C. Seshadhri, Seshadhri, C., Jan Vondrák +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #semigroups and automata theory
  15. Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
    2021/06/05 by Noujan Pashanasangi, C. Seshadhri, Pashanasangi, Noujan +1 · 2 citations
    Computer Science · Physics and Astronomy · #Caching and Content Delivery #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI)
  16. Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The\n Barrier of Long Induced Cycles
    2020/10/15 by Suman K. Bera, Noujan Pashanasangi, Bera, Suman K. +3 · 2 citations
    Mathematics · Computer Science · #Markov Chains and Monte Carlo Methods #Advanced Graph Theory Research #Graph theory and applications
  17. A space efficient streaming algorithm for triangle counting using the birthday paradox
    2012/12/11 by Jha, Madhav, Seshadhri, C., Pinar, Ali · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Social and Information Networks (cs.SI)
  18. Directed closure measures for networks with reciprocity
    2013/02/25 by Seshadhri, C., Pinar, Ali, Durak, Nurcan +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)
  19. An optimal lower bound for monotonicity testing over hypergrids
    2013/04/18 by Chakrabarty, Deeparnab, Seshadhri, C. · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  20. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
    2014/11/12 by Sariyuce, Ahmet Erdem, Seshadhri, C., Pinar, Ali +1 · 1 citation
    #FOS: Computer and information sciences #Social and Information Networks (cs.SI)
  21. Catching the head, tail, and everything in between: a streaming\n algorithm for the degree distribution
    2015/06/08 by Olivia Simpson, Simpson, Olivia, C. Seshadhri +3 · 1 citation
    Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Topological and Geometric Data Analysis
  22. Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
    2017/03/15 by Baleshzar, Roksana, Chakrabarty, Deeparnab, Pallavoor, Ramesh Krishnan S. +2 · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  23. A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube
    2017/05/31 by Baleshzar, Roksana, Chakrabarty, Deeparnab, Pallavoor, Ramesh Krishnan S. +2 · 1 citation
    #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  24. A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
    2024/06/12 by Sabyasachi Basu, Basu, Sabyasachi, Nadia Kōshima +7 · 3 citations
    Computer Science · Engineering · #Advanced Optical Network Technologies #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Network Traffic and Congestion Control #Social and Information Networks (cs.SI)
  25. Improved Massively Parallel Triangle Counting in O(1) Rounds
    2024/05/01 by Quanquan C. Liu, Liu, Quanquan C., C. Seshadhri +1 · 2 citations
    Computer Science · Engineering · #3D Shape Modeling and Analysis #Advanced Numerical Analysis Techniques #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Image Processing and 3D Reconstruction #Parallel #and Cluster Computing (cs.DC)
  26. On Approximating the Number of k-cliques in Sublinear Time
    2017/07/16 by Eden, Talya, Ron, Dana, Seshadhri, C. · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  27. A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
    2022/11/16 by Paul-Pena, Daniel, Seshadhri, C. · 2 citations
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  28. Finding Cycles and Trees in Sublinear Time
    2010/07/23 by Czumaj, Artur, Goldreich, Oded, Ron, Dana +3 · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  29. Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
    2025/07/09 by Lorenzo Beretta, Beretta, Lorenzo, Deeparnab Chakrabarty +3 · 3 citations
    Computer Science · Physics and Astronomy · #Advanced Graph Theory Research #Complex Network Analysis Techniques #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  30. Theoretical bounds on the network community profile from low-rank semi-definite programming
    2023/03/25 by Huang, Yufan, Seshadhri, C., Gleich, David F. · 1 citation
    #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Social and Information Networks (cs.SI)
  31. Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
    2024/10/10 by Paul-Pena, Daniel, Seshadhri, C. · 2 citations
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  32. Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
    2025/02/22 by Chakrabarty, Deeparnab, Chen, Xi, Ristic, Simeon +2 · 1 citation
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Statistics Theory (math.ST)
  33. Accurate and Fast Estimation of Temporal Motifs using Path Sampling
    2024/09/13 by Pan, Yunjie, Bhalerao, Omkar, Seshadhri, C. +1 · 2 citations
    #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Social and Information Networks (cs.SI)
  34. Decompositions of Triangle-Dense Graphs
    2013/09/28 by Rishi Gupta, Tim Roughgarden, Gupta, Rishi +3 · 1 citation
    Physics and Astronomy · Computer Science · #Complex Network Analysis Techniques #Advanced Graph Theory Research #Complexity and Algorithms in Graphs