3 problems

GlobalClock contention-resolution conjecture. In the finite setting, there exists a protocol with latency $O(n)$ with high probability against an adaptive adversary. In the unbound…

Let $A=(a_{ij})$ be a doubly stochastic $n\times n$ matrix, and let $W=(w_{ij})$ be a matrix of edge weights satisfying … Let $R$ be the random bipartite graph in which edge…

Let $K_{n,n}$ be the complete bipartite graph with $n$ vertices on each side. A fractional bipartite matching is a collection of edge probabilities $x=(x_{uv})$ satisfying the vert…