Nikhil S. Mande
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Arkadev Chattopadhyayonce
- Suhail Sherifonce
- Swagato Sanyalonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Randomized versus Deterministic Decision Tree Size | Structural Results 2023 | 2023-07-20 |
Proves that, up to polylog(n) factors, log of deterministic decision tree size is at most the fourth power of the log of bounded‑error randomized size (log^4… | ||
| 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… | ||
| nothing matches | ||