Yuval Emek

A single parameter adjustment allows for a seamless trade-off between execution time and message complexity, optimizing leader election for diverse network conditions.

A surprisingly simple "Drop or Trust Blindly" compiler achieves state-of-the-art consistency-robustness trade-offs for classic online problems like caching, metrical task systems, and bipartite matching, even with unreliable ML guidance.