Samson Zhou
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
all 6 in the filters
who talks about the same things
- Michael Kapralov7 talks
- David P. Woodruff18 talks
- Yuichi Yoshida4 talks
- Zhao Song2 talks
- Toniann Pitassi5 talks
- Sitan Chen3 talks
| title | conference | date |
|---|---|---|
| A Strong Separation for Adversarially Robust L_0 Estimation for Linear Sketches | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Gives the first adaptive attack against linear sketches for turnstile L_0 estimation, showing any sketch that achieves a constant-factor gap must use… | ||
| Streaming Euclidean k-median and k-means with o(log n) Space | Sketching and Algorithm Design 2023 | 2023-10-09 |
Presents a streaming algorithm that breaks the long standing Omega(log(n Delta)) word barrier for insertion-only Euclidean (k,z)-clustering by producing a… | ||
| Noisy Boolean Hidden Matching with Applications | ITCS 2022 | 2022-01-31 |
Defines p-noisy Boolean hidden matching where each matching edge flips independently with probability p and proves the plaintext protocol is optimal, giving… | ||
| Sensitivity Analysis of the Maximum Matching Problem | ITCS 2021 | 2021-01-06 |
Gives a randomized algorithm that achieves a 1+ε approximation with O(1) worst-case edge sensitivity (uses randomized greedy + McGregor’s layered… | ||
| nothing matches | ||