Amit Chakrabarti
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Manuel Stoecklonce
- Prantar Ghoshonce
who talks about the same things
- Arkadev Chattopadhyay6 talks
- Gillat Kol5 talks
- Amit Levi2 talks
- Lijie Chen9 talks
- Utsab Ghosal2 talks
- Michael Kapralov7 talks
| title | conference | date |
|---|---|---|
| Adversarially Robust Coloring for Graph Streams | ITCS 2022 | 2022-01-31 |
Shows a concrete lower bound: any adversarially robust k‑coloring algorithm for Δ‑bounded graphs uses Ω(n Δ^2 / k) space, so robust Δ+1 or O(Δ) colorings force… | ||
| Time-Space Tradeoffs for the Memory Game | Interactive Complexity 2018 | 2018-10-15 |
Deterministic algorithms that only compare cards for equality achieve a pass-based tradeoff with a simple upper bound s·T = n^2, and a matching lower bound (up… | ||
| Streaming Interactive Proofs and Arthur-Merlin Communication | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Claims a verifier with only polylog space can answer point membership and nearest-neighbor queries by turning the stream into a multilinear polynomial, storing… | ||
| nothing matches | ||