On the Resiliency of Randomized Routing Against Multiple Edge Failures

by Chiesa, Marco, Gurtov, Andrei, Madry, Aleksander, Mitrovic, Slobodan, Nikolaevskiy, Ilya, Shapira, Michael, Shenker, Scott
Published 2018

The fewest clues problem

by Fermi, Ma, Schvartzman, Ariel, Waingarten, Erik, Demaine, Erik D, Aaronson, Scott
Published 2017

Brief announcement: Practical synchronous byzantine consensus

by Abraham, Ittai, Devadas, Srinivas, Nayak, Kartik, Ren, Ling
Published 2019

Lower Bound on Expected Communication Cost of Quantum Huffman Coding

by Anshu, Anurag, Garg, Ankit, Yao, Penghui, Harrow, Aram W
Published 2017

Tight SoS-Degree Bounds for Approximate Nash Equilibria

by Wu, Xiaodi, Harrow, Aram W, Natarajan, Anand Venkat
Published 2017

Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard

by Demaine, Erik D, Hendrickson, Dylan H., Lynch, Jayson R.
Published 2020

Noise stability is computable and approximately low-dimensional

by De, Anindya, Mossel, Elchanan, Neeman, Joe
Published 2018

Solving the Rubik's Cube optimally is NP-complete

by Demaine, Erik D, Eisenstat, Sarah Charmian, Rudoy, Mikhail
Published 2019

Bridging the Gap Between General-Purpose and Domain-Specific Compilers with Synthesis

by Cheung, Alvin, Kamil, Shoaib, Solar Lezama, Armando
Published 2018

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree

by Barak, Boaz, O'Donnell, Ryan, Raghavendra, Prasad, Regev, Oded, Steurer, David, Trevisan, Luca, Vijayaraghavan, Aravindan, Witmer, David, Wright, John, Moitra, Ankur
Published 2016