Pasin Manurangsi
where else to find them
what they talk about
all 5 in the filters
where they keep going back
- ITCS2 editions2021–2023
on a stage with
all 24 in the filters
who talks about the same things
- Badih Ghazi4 talks
- Lijie Chen9 talks
- Ravi Kumar8 talks
- Aaron Roth11 talks
- Jelani Nelson10 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| A DP Framework for Gaining Insights into AI Chatbot Use | PEPR '26 | 2026-06-01 |
Urania converts millions of raw chatbot logs into DP-safe summaries and trends, claiming end-to-end ε,δ DP guarantees by privatizing cluster centers and… | ||
| Algorithms with More Granular Differential Privacy Guarantees | ITCS 2023 | 2023-01-10 |
Defines per-attribute differential privacy and gives concrete algorithms that trade per-person epsilon for much smaller per-attribute epsilon0. Uses Gaussian… | ||
| Private Counting of Distinct and k-Occurring Items in Time Windows | ITCS 2023 | 2023-01-10 |
Paper gives private algorithms for counting distinct and k-occurring items over time windows by reducing these queries to differentially private range queries… | ||
| Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique | ITCS 2023 | 2023-01-10 |
Reduction from the exponential biclique problem maps a bipartite graph to its adjacency matrix as a concept class, then applies random edge sparsification… | ||
| Algorithmic Persuasion with Evidence | ITCS 2021 | 2021-01-06 |
Paper at ITCS 2021 studies persuasion with unforgeable evidence, gives a polynomial-time max-flow algorithm that computes a sequential equilibrium, and proves… | ||
| The Strongish Planted Clique Hypothesis and Its Consequences | ITCS 2021 | 2021-01-06 |
Postulates that for kappa = N^{0.1} planted clique cannot be solved in time N^{o(log N)} and uses a randomized graph product that samples N random L‑vertex… | ||
| Tight Hardness Results for Training Depth-2 ReLU Networks | ITCS 2021 | 2021-01-06 |
Proves concrete limits and matching algorithms for depth-2 ReLU training: shows single-ReLU NP-hard (agnostic) and NP-hardness for any K≥2 in the realizable… | ||
| On Distributed Differential Privacy and Counting Distinct Elements | ITCS 2021 | 2021-01-06 |
Shows that distinct counting under constant-epsilon, delta = 1/poly(n) privacy is basically impossible in the local model: any local protocol needs error ≈ N /… | ||
| nothing matches | ||