How to Sort a Train

Date: 
Tuesday, September 22, 2009 - 5:21pm

UCSB COMPUTER SCIENCE DEPARTMENT PRESENTS:

MONDAY, SEPTEMBER 28, 2009
3:30 – 4:30
Computer Science Conference Room, Harold Frank Hall Rm. 1132

HOST: Subhash Suri

SPEAKER: PETER WIDMAYER
Institute of Theoretical Computer Science, ETH
Zurich, Switzerland

Title: How to Sort a Train

Abstract:

This talk attempts to provide an introductory survey of methods for
sorting trains in railway yards from an algorithmic perspective, and to
highlight open problems in this area.

Bio:

Since 1992 Peter Widmayer has been full Professor of Computer Science at
ETH Zurich (Chair of Algorithms, Data Structures, and
Applications).Prof. Widmayer, who was born in 1953, is from Ehningen,
Germany. He studied at the Technical University in Karlsruhe, where he
received his doctorate with a dissertation on algorithms and complexity
in computer graphics and VLSI design. Afterwards, he spent a year at the
IBM T. J. Watson Research Center in Yorktown Heights NY. He completed
his habilitation at the University of Karlsruhe with his work on
Approximation algorithms for Steiner’s problem in graphs. As professor
of Computer Science he taught at the University of Freiburg in Breisgau
and has been lecturing in theoretical computer science at the ETH Zurich
since 1992. His research interests lie in the area of data structures
and algorithms.Throughout his teaching career, Prof. Widmayer has
supported the use of the computer to transfer knowledge. With his
colleagues, he has produced media courses on a variety of topics
relating to the area of algorithms and data structures. One of his
textbooks “Algorithmen und Data Structuren” (in collaboration with Th.
Ottmann), is available in electronic form.