| No. |
Title |
Author |
Year |
| 1 |
Beyond Worst-Case Budget-Feasible Mechanism Design |
Rubinstein, Aviad et al. |
2023 |
| 2 |
Budget-Smoothed Analysis for Submodular Maximization |
Rubinstein, Aviad et al. |
2022 |
| 3 |
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation |
Rubinstein, Aviad et al. |
2022 |
| 4 |
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence |
Cheng, Kuan et al. |
2021 |
| 5 |
The Strongish Planted Clique Hypothesis and Its Consequences |
Manurangsi, Pasin et al. |
2021 |
| 6 |
Optimal Single-Choice Prophet Inequalities from Samples |
Rubinstein, Aviad et al. |
2020 |
| 7 |
Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria |
Etessami, Kousha et al. |
2020 |
| 8 |
Computing Exact Minimum Cuts Without Knowing the Graph |
Rubinstein, Aviad et al. |
2018 |
| 9 |
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds |
Abboud, Amir et al. |
2018 |
| 10 |
Detecting communities is Hard (And Counting Them is Even Harder) |
Rubinstein, Aviad |
2017 |
| 11 |
Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder |
Rubinstein, Aviad |
2017 |
