Arkadev Chattopadhyay
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
all 4 in the filters
on a stage with
- Nikhil S. Mandeonce
- Partha Mukhopadhyayonce
- Rajit Dattaonce
all 6 in the filters
who talks about the same things
- Partha Mukhopadhyay2 talks
- Utsab Ghosal2 talks
- Toniann Pitassi5 talks
- Gillat Kol5 talks
- Suhail Sherif3 talks
- Amit Chakrabarti3 talks
| title | conference | date |
|---|---|---|
| Lifting to Parity Decision Trees Via Stifling | ITCS 2023 | 2023-01-10 |
Proves a concrete lifting theorem: parity decision tree (PDT) size of S composed with majority on 3 bits is at least 2^{DT(S)}, and more generally if gadget g… | ||
| Monotone Complexity of Spanning Tree Polynomial Re-visited | ITCS 2022 | 2022-01-31 |
Shows that the spanning tree polynomial on theta(N) variables for constant-degree expander families requires monotone circuits of size 2^{Omega(N)}, giving the… | ||
| Simulation beats Richness: New Data-Structure Lower Bounds | Interactive Complexity 2018 | 2018-10-15 |
Proves average-case lower bounds for Boolean matrix–vector problems by reducing data-structure probes to an asymmetric communication game and a lifting… | ||
| A Short List of Equalities Has Large Sign Rank | Boolean Devices 2018 | 2018-09-10 |
Constructs a concrete depth‑two threshold-of-threshold function — essentially odd-max-bit of equality — and proves it has unexpectedly large sign rank (about… | ||
| Tribes is Hard in the Message Passing Model | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Shows that Tribes in the coordinator (star) message‑passing model has randomized communication Theta(nk) for the typical setting m = l = √n, so the naive… | ||
| nothing matches | ||