![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Friday 23 May 2008, 14:30-15:30
Title to be confirmed
- đ¤ Speaker: Andy Twigg (University of Cambridge)
- đ Date & Time: Friday 23 May 2008, 14:30 - 15:30
- đ Venue: Computer Laboratory, William Gates Building, Room GS15
Abstract
Note the unusual room
Abstract:
Bio:
Andy is a postdoc at the Computer Laboratory. He finished his PhD in 2006 at Cambridge. He was a Marie Curie fellow at BRICS in 2003, then spent four months in 2006 at Microsoft Research Cambridge then 2007-2008 as a postdoc at Thomson Research, Paris (Thomson page).
Research interests: Graph algorithms, routing, scheduling
He’s mainly interested in graph problems applied to computing, like routing and scheduling problems in networks. Recently he’s been interested in so-called constrained routing problems, which generalise compact routing from shortest paths, and in combinatorial markets and algorithms for storage systems (eg data centers).
More at Andy’s page
Series This talk is part of the Computer Laboratory Opera Group Seminars series.
Included in Lists
This talk is not included in any other list.
Note: Ex-directory lists are not shown.