Recent News
UNM to collaborate with UC Berkeley on $10M USDOT grant for rural autonomous vehicle freight program
February 3, 2025
López honored as outstanding UW alum for ‘Creating a Healthier and More Just World’
January 29, 2025
Mala Htun remembered as advocate for progress
January 28, 2025
UNM alum to present Nuclear Engineering seminar on public policy engagement
January 23, 2025
News Archives
CS Professor Saia's paper on scalable Byzantine agreement selected as a best paper at PODC
June 28, 2010
The paper "Breaking the O(n^2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary" by Valerie King and Jared Saia was selected to appear in the best paper session at the Principles of Distributed Computing (PODC) conference. Professor Saia's paper describes an algorithm that solves the Byzantine agreement problem with a significantly less communication than any previous results. The venerable Byzantine agreement problem has applications in many areas including: cloud computing, grid computing, peer-to-peer networks data base systems, sensor networks and game theory. A key novelty of the paper is that it is robust against an adaptive adversary that can choose which nodes to take over at any time during the algorithm, up to taking over up to a 1/3 fraction of the nodes. The full paper along with a formal description of the Byzantine agreement problem is available here.