Roger Wattenhofer is a full professor at the Information Technology and Electrical Engineering Department, ETH Zurich, Switzerland. He received his doctorate in Computer Science in 1998 from ETH Zurich. From 1999 to 2001 he was in the USA, first at Brown University in Providence, RI, then at Microsoft Research in Redmond, WA. He then returned to ETH Zurich, originally as an assistant professor at the Computer Science Department.

Roger Wattenhofer's research interests are a variety of algorithmic and systems aspects in
computer science and information technology, currently in particular wireless networks, wide
area networks, mobile systems, social networks, and physical algorithms. He publishes in different
communities: distributed computing (e.g., PODC, SPAA, DISC), networking (e.g., SIGCOMM,
MobiCom, SenSys), or theory (e.g., STOC, FOCS, SODA, ICALP).

AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI   Info

Public Audience

English

-- Not specified --

Saarbrücken

What can be computed, and how efficiently, is a core question in
computer science. Not surprisingly, in distributed systems and networking
research, a fundamental question is what can be computed how efficiently in
a distributed fashion, in a network. More precisely, if nodes of a network
must solve a problem by locally communicating with their neighbors, how fast
can they compute (or approximate) a global (optimization) problem?
Throughout the years, we studied different aspects and problems of this
"network complexity" theory. In my talk I will discuss a few facets, e.g.,
how to compute the network diameter, or the role of randomness. Towards the
end of the talk I will present some nuggets regarding "complex networks", in
particular updates in Software Defined Networks, and attacks on the Bitcoin
network.

Connie Balzert

0681 9325-2000

--email hidden

passcode not visible

logged in users only