News Archives

RSS Feed

[Colloquium] Conflict in Networks

September 24, 2010

Watch Colloquium: 

M4V file (467 MB)

  • Date: Friday, September 24, 2010 
  • Time: 12noon — 12:50 pm 
  • Place: Centennial Engineering Center, Room 1041

Jared Saia
Assoc. Professor Department of Computer Science University of New Mexico

This talk will survey work being done in my research group. We will cover work on the following three problems. First, designing a scalable algorithm for consensus and the Byzantine agreement problem. Second, designing networks and algorithms that are robust to web-censorship. Third, a game theoretic analysis of the secret sharing problem, in which nplayers each have a share of a secret and each player would prefer to learn the secret themselves but not have any other player learn it.

Bio: Jared Saia is an Assoc. Professor in the UNM CS department. His broad research interests are in theory and algorithms with strong interests in distributed algorithms, game theory, security, and spectral methods. A current interest is determining how large groups can function effectively when there is no leader.