Showing 1–20 of 39 results
/ Date/ Name
Apr 22, 2011Enforcing efficient equilibria in network design games via subsidiesApr 22, 2014A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic PathJul 24, 2019Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine ProtocolsJul 28, 2019Spartan: Sparse Robust Addressable NetworksFeb 13, 2020Distributed Graph RealizationsFeb 7, 2006Approximate Weighted Farthest Neighbors and Minimum Dilation StarsSep 14, 2020Economy Versus Disease Spread: Reopening Mechanisms for COVID 19Dec 30, 2022Recurrent Problems in the LOCAL modelApr 18, 2022Awake Complexity of Distributed Minimum Spanning TreeMay 12, 2020Guarding a Polygon Without Losing TouchAug 3, 2011Distributed Agreement in Dynamic Peer-to-Peer NetworksJun 23, 2016Optimal Evacuation Flows on Dynamic Paths with General Edge CapacitiesMay 3, 2017Sustaining Moore's Law Through InexactnessSep 28, 2023Byzantine Resilient Computing with the CloudSep 3, 2025Distributed Download from an External Data Source in Asynchronous Faulty SettingsNov 12, 2011Localized Geometric Query ProblemsMay 6, 2013Storage and Search in Dynamic Peer-to-Peer NetworksOct 25, 2010Dynamics of Profit-Sharing GamesFeb 20, 2009Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor NetworksSep 16, 2008Largest Empty Circle Centered on a Query Line