Anup Bhattacharya
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 1 in the filters
on a stage with
- Anannya Upasanaonce
- Arijit Bishnuonce
- Gopinath Mishraonce
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming! | ITCS 2021 | 2021-01-06 |
Establishes one-pass streaming bounds for estimating the number of monochromatic edges given a coloring: an algorithm that stores sample R of size n/√T (first… | ||
| nothing matches | ||