C. Seshadhri

activity

20102025

most citedFAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs

28 citations · 110 across the 12 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.SI2016★ 21 cited

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

Ali Pinar, C. Seshadhri, V. Vishal

Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special cas…

cs.DS2016★ 9 cited

A $O (n)$ Non-Adaptive Tester for Unateness

Deeparnab Chakrabarty, C. Seshadhri

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O (n lo g (n) / ε)$ -query tester for unateness of Boolean functions $f : {0, 1}^{n} \to {0, 1}$ . In this note we…

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

A O(n) Non-Adaptive Tester for Unateness

A $O (n)$ Non-Adaptive Tester for Unateness