Jiapeng Zhang
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
- Shachar Lovett3×
- Ian Mertzonce
- Qian Lionce
all 6 in the filters
who talks about the same things
- Shachar Lovett9 talks
- Toniann Pitassi5 talks
- Raghu Meka5 talks
- Tushant Mittal2 talks
- Madhur Tulsiani4 talks
- Qipeng Liu2 talks
| title | conference | date |
|---|---|---|
| Streaming Lower Bounds for the Needle Problems | Sketching and Algorithm Design 2023 | 2023-10-09 |
Shows a near-tight lower bound: any streaming algorithm with space s needs about t ≈ 1/(s p^2) samples (multipass adds an l factor) to distinguish uniform vs… | ||
| Fractional certificates for bounded functions | ITCS 2023 | 2023-01-10 |
Defines epsilon-fractional certificate complexity and proves that any bounded function f with polynomial degree D satisfies Fc_eps(f) = O(D^8 log^16 n / eps^4)… | ||
| 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… | ||
| nothing matches | ||