Deeparnab Chakrabarty
where else to find them
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Shaving logs by weighing coins | Extroverted Sublinear Algorithms 2024 | 2024-06-17 |
Claims an order-n expected cut-query algorithm to find a spanning forest (shaving the standard n log n), using coin-weighing / Lindström–Cantor–Mills… | ||
| The Non-Uniform k-Center Problem | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Classic k‑center stays 2‑approx, and the nonuniform version gets concrete results: an LP-to-firefighter reduction converts a fractional solution on the metric… | ||
| nothing matches | ||