No. Title Author Year
1 Optimal Single-Choice Prophet Inequalities from Samples Rubinstein, Aviad et al. 2020
2 Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria Etessami, Kousha et al. 2020
3 Computing Exact Minimum Cuts Without Knowing the Graph Rubinstein, Aviad et al. 2018
4 Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds Abboud, Amir et al. 2018
5 Detecting communities is Hard (And Counting Them is Even Harder) Rubinstein, Aviad 2017
6 Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder Rubinstein, Aviad 2017
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI