Aviad Rubinstein
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS3 editions2021–2023
on a stage with
- Junyao Zhao2×
- Binghui Pengonce
- Pasin Manurangsionce
all 4 in the filters
who talks about the same things
- Junyao Zhao2 talks
- Dor Minzer8 talks
- Mark Braverman5 talks
- Subhash Khot3 talks
- Makrand Sinha5 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| Memory-Regret Tradeoff for Online Learning | Sketching and Algorithm Design 2023 | 2023-10-09 |
Shows two concrete tradeoffs and gives matching algorithms and lower bounds: against an oblivious adversary an algorithm using S bits achieves about sqrt(nT/S)… | ||
| Beyond Worst-Case Budget-Feasible Mechanism Design | ITCS 2023 | 2023-01-10 |
Presents a simple randomized mechanism that partitions sellers, learns a best lottery of two take-it-or-leave-it payments on each half, and offers samples from… | ||
| Budget-Smoothed Analysis for Submodular Maximization | ITCS 2022 | 2022-01-31 |
Paper introduces budget-smoothed analysis where an adversary picks a worst-case submodular function and the budget is sampled from a fixed distribution, gives… | ||
| 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… | ||
| ETH Hardness for Densest-k-Subgraph with Perfect Completeness | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Claim: under ETH there is no quasi‑polynomial algorithm for Densest‑k‑Subgraph with perfect completeness; the reduction blows up to about 2^{√n} vertices and… | ||
| nothing matches | ||