C. Seshadhri
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Balaram Beheraonce
- Edin Husićonce
- Shweta Jainonce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Monotonicity testing, routing, and a theorem of Lehman and Ron | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
States the Lehman–Ron routing theorem: given two same-level subsets S and T of the directed d‑cube with a bijection matching each s to a larger t, there exist… | ||
| The long path to \sqrt{d} monotonicity testers | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Shows an almost-complete resolution: non-adaptive monotonicity testing on {n}^d uses √d query "path testers" that run short upward random walks (length ≈√d)… | ||
| Counting Subgraphs in Sublinear Time | Sublinear Algorithms Boot Camp 2024 | 2024-05-21 |
Shows concrete sublinear estimators and their costs: sampling √n uniform vertices gives a 2-approx for average degree (Feige), while an orientation by degree… | ||
| FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs | ITCS 2022 | 2022-01-31 |
Proves fixed-parameter algorithms that enumerate specific near-cliques in c-closed graphs, with concrete bounds: FPT enumeration of maximal (d+1)-plexes in… | ||
| When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
A MapReduce-style algorithm (WIMP) combines wedge sampling (Cohen–Lewis) with SimHash sketches to approximate all pairs with cosine similarity ≥ τ while… | ||
| nothing matches | ||