1. Local max-cut in smoothed polynomial time
2. An exponential lower bound for Cunningham’s rule
3. Christel Baier , Luca de Alfaro , Vojtech Forejt , and Marta Kwiatkowska . 2018. Model Checking Probabilistic Systems . In Handbook of Model Checking, Edmund M . Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (Eds.). Springer , 963–999. Christel Baier, Luca de Alfaro, Vojtech Forejt, and Marta Kwiatkowska. 2018. Model Checking Probabilistic Systems. In Handbook of Model Checking, Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (Eds.). Springer, 963–999.
4. R. Bellman . 1957. Dynamic Programming . Princeton University Press . R. Bellman. 1957. Dynamic Programming. Princeton University Press.
5. Improving the Smoothed Complexity of FLIP for Max Cut Problems