Title: Conflict in Networks Speaker: Jared Saia, University of New Mexico Date/Time: Thursday, April 24, 2008, 10:00 – 11:00 am Location: CSRI Building/Room 90 (Sandia NM) Brief Abstract: This talk will be a brief overview of three areas of recent work on designing robust, large-scale networks. First, we will describe a result that resolves a 23 year old open question: "Does there exist a polynomial time algorithm for asynchronous Byzantine agreement?" Next, we will describe how an alert can spread more quickly than a worm over a large network. Finally, we will discuss how a network can self-heal even when an omniscient adversary repeatedly removes carefully chosen nodes. CSRI POC: Cindy Phillips (505) 845-7296 |