Raghuvansh R. Saxena
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
all 6 in the filters
who talks about the same things
- Klim Efremenko5 talks
- Gillat Kol5 talks
- Dmitry Paramonov3 talks
- S. Matthew Weinberg3 talks
- Makrand Sinha5 talks
- Michael Kapralov7 talks
| title | conference | date |
|---|---|---|
| Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds | ITCS 2023 | 2023-01-10 |
Proves that noisy-CAS vs CAS can incur the worst-case slowdown Θ(log n): any adaptive protocol that uses √n rounds on CAS yields an equivalent beeping (OR)… | ||
| Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly | ITCS 2023 | 2023-01-10 |
Claim: p pass streaming algorithms need space Theta(n^{deg(f)}) to compute Max‑CSPf exactly where deg(f) is f's multilinear polynomial degree and p is… | ||
| 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… | ||
| Computation Over the Noisy Broadcast Channel with Malicious Parties | ITCS 2021 | 2021-01-06 |
Shows a protocol that computes bit‑exchange over a noisy broadcast channel tolerating up to half malicious parties while cutting per‑player communication from… | ||
| nothing matches | ||