Toniann Pitassi
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
on a stage with
- Adi Shraibmanonce
- Amos Beimelonce
- Benny Applebaumonce
all 12 in the filters
who talks about the same things
- Shachar Lovett9 talks
- Jiapeng Zhang3 talks
- Yuval Filmus9 talks
- Noah Fleming6 talks
- Lijie Chen9 talks
- Tushant Mittal2 talks
| title | conference | date |
|---|---|---|
| The Strength of Equality Oracles in Communication | ITCS 2023 | 2023-01-10 |
Provides tight (up to polylog factors) characterizations of NP^EQ, ∃·EQ, UP^EQ and U·EQ in terms of the blocky covering number, the blocky partition number… | ||
| Lifting With Sunflowers | ITCS 2022 | 2022-01-31 |
Proves that many lifting theorems (tree‑like, DAG‑like, depth‑dependent) follow from a single sunflower‑based lemma, replacing lengthy casework with a short… | ||
| Extremely Deep Proofs | ITCS 2022 | 2022-01-31 |
Proves that for resolution, k‑DNF resolution and cutting planes there are CNFs on n variables with polynomial‑size proofs but any subexponential‑size proof… | ||
| Secret Sharing, Slice Formulas, and Monotone Real Circuits | ITCS 2022 | 2022-01-31 |
Proves that recent secret sharing techniques cannot achieve subexponential complexity by exhibiting a monotone P function whose schemes (and corresponding… | ||
| Deterministic Communication vs. Partition Number | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves a superlinear gap: deterministic communication complexity grows like (log partition number)^{1.5} (up to polylogs) and for the one-rectangle measure… | ||
| nothing matches | ||