Brief Bio
C. Seshadhri (Sesh) is an associate professor of Computer Science at the University of California, Santa Cruz. Prior to joining UCSC, he was a researcher at Sandia National
Labs, Livermore in the Information Security Sciences department, during 20102014. His primary interest is in mathematical foundations of big data,
especially modeling and algorithms. By and large, he works at the boundary of theoretical computer science (TCS) and data mining.
His work spans many areas: sublinear algorithms, graph algorithms, graph modeling, scalable computation,
and data mining. A number of his papers in the interface of TCS and applied algorithms have received
paper awards at KDD, WWW, ICDM, and SDM. He got his Ph.D from Princeton University and spent two years as a postdoc in IBM Almaden Labs.
CV: pdf
Program Committees
WWW 2019,
SDM 2019,
WWW 2018,
ITCS 2018,
WSDM 2018,
ALENEX 2018,
KDD 2017,
SIAM CSC 2016,
SIAMNS 2015,
ITCS 2015,
SODA 2014,
FSTTCS 2013,
FOCS 2012
 • Finding forbidden minors in sublinear time: a $O(n^{1/2+o(1)})$query onesided tester for minor closed properties on bounded degree graphs, with Akash Kumar and Andrew Stolman
 FOCS 2018
 • A Fast and Provable Method for Estimating Clique Counts Using Tur\'{a}n's Theorem, with Shweta Jain
 WWW 2017 (Best paper)
 • When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors,
with A. Sharma, A. Goel
 WWW 2017
 • Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance,
with T. Naumovitz, M. Saks
 SODA 2017
 • A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm,
with B. Raichel
 SOCG 2016 (Invited to special issue)
 • Approximately Counting Triangles in Sublinear Time,
with T. Eden, A. Levi, D. Ron
 FOCS 2015
 • Diamond Sampling for Approximate Maximum Allpairs Dotproduct (MAD) Search,
with G. Ballard, T. Kolda, A. Pinar
 ICDM 2015 (Best paper)
 • Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions,
with A. Sariyuce, A. Pinar, U. Catalyurek
 WWW 2015 (Best paper finalist)
 • Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties,
with D. Chakrabarty, K. Dixit, M. Jha
 SODA 2015 (Invited to special issue)
 • Decompositions of TriangleDense Graphs,
with R. Gupta, T. Roughgarden
 ITCS 2014
 • A Space Efficient Streaming Algorithm for Triangle Counting using the Birthday Paradox,
with M. Jha, A. Pinar
 KDD 2013 (Best student paper)
 • An o(n) Monotonicity Tester for Boolean Functions over the Hypercube,
with D. Chakrabarty
 STOC 2013 (Invited to special issue)
 • Optimal Bounds for Monotonicity and Lipschitz Testing over
Hypercubes and Hypergrids,
with D. Chakrabarty
 STOC 2013
 • Triadic Measures on Graphs: The Power of Wedge Sampling,
with A. Pinar, T. Kolda
 SDM 2013 (Best research paper)

PhD Students
Shweta Jain
Andrew Stolman
William Bolden
Masters Students
Hadley Black
Theory seminar@UCSC
We have a regular TCS seminar at UCSC.
Please contact me or Andrew Stolman (astolman@) to set up
a talk.
PTReview
Eric Blais, Sourav Chakraborty, and I started a blog called Property Testing Review,
a monthly digest of property testing and sublinear algorithms papers. Currently, it is edited
by Clement Canonne, Gauram Kamath, and myself.
