Robert Krauthgamer
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
- Barna Sahaonce
- Debarati Dasonce
- Diptarka Chakrabortyonce
all 5 in the filters
who talks about the same things
- Sepehr Assadi9 talks
- Mark Braverman5 talks
- Dor Minzer8 talks
- Makrand Sinha5 talks
- François Le Gall4 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| An Algorithmic Bridge Between Hamming and Levenshtein Distances | ITCS 2023 | 2023-01-10 |
Presents a 1+ε approximation algorithm for the new EDa metric (substitution cost 1/a, indel cost 1) that runs sublinearly for realistic parameters: overall… | ||
| Clustering Permutations: New Techniques with Streaming Applications | ITCS 2023 | 2023-01-10 |
Presents a concrete algorithm that gives a 1.99-approximation for the Ulam 1‑median (improving over the prior 2−ε with ε ≈ 2^−40), extends to k‑median and… | ||
| Spectral Approaches to Nearest Neighbor Search | Learning, Algorithm Design and Beyond Worst-Case Analysis | 2016-11-14 |
Claims that when data equals a hidden k-dimensional subspace plus independent Gaussian noise of magnitude σ ≈ d^{-1/4}, the exact nearest neighbor remains… | ||
| nothing matches | ||