Nikhil Bansal
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 3 in the filters
on a stage with
- Gourav Takharonce
- Haotian Jiangonce
- Makrand Sinhaonce
all 8 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On the Komlós Conjecture | The Role of TCS in Modern Machine Learning | 2026-05-26 |
Proves an O((log n)^{1/4}) bound for Komlós, improving the prior Banaszczyk O((log n)^{1/2}) rate, via a polynomial‑time constructive method that repeatedly… | ||
| Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing | ITCS 2022 | 2022-01-31 |
Shows that in a smoothed model (noise whose covariance has nontrivial projection in every direction) the Banaszczyk bound improves to sqrt(log d)+sqrt(log log… | ||
| When Oblivious is Not: Attacks against OPAM | WOOT '20 | 2020-08-11 |
Shows a practical break of InvisiPage/OPAM: shuffling and single-page transfers occur outside the enclave without re‑encryption, so the OS observes which page… | ||
| nothing matches | ||