MIT Open Access Articles: Recent submissions

Now showing items 1-3 of 55207

    • Expected Constant Round Byzantine Broadcast under Dishonest Majority 

      Wan, Jun; Xiao, Hanshen; Shi, Elaine; Devadas, Srinivas
      Byzantine Broadcast (BB) is a central question in distributed systems, and an important challenge is to understand its round complexity. Under the honest majority setting, it is long known that there exist randomized ...

    • Minimum Plane Bichromatic Spanning Trees 

      Akitaya, Hugo; Biniaz, Ahmad; Demaine, Erik; Kleist, Linda; Stock, Frederick; e.a.
      For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in O(n log ...

    • Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time 

      Dong, Sally; Gao, Yu; Goranci, Gramoz; Lee, Yin Tat; Sachdeva, Sushant; e.a. (ACM, 2025-07-26)
      We present a nearly-linear time algorithm for finding a minimum-cost flow in planar graphs with polynomially bounded integer costs and capacities. The previous fastest algorithm for this problem is based on interior point ...