Santhoshini Velusamy
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Sketching Algorithms for Max-DICUT and other CSPs | Sketching and Algorithm Design 2023 | 2023-10-09 |
Claims a concrete sketching pipeline: compute the L1 bias via an Indyk-style sketch to get a 2/5 approximation, then refine to 4/9 and 0.485–0.486… | ||
| An Improved Lower Bound for Matroid Intersection Prophet inequalities | ITCS 2023 | 2023-01-10 |
Proves an improved impossibility: the prophet inequality for an intersection of q partition matroids is at least q^{1/2+1/\log\log q} (so super-√q). Uses the… | ||
| nothing matches | ||