Main content

Welcome to the Chair of Algorithms, Data Structures, and Applications

We perform research and teaching in algorithms, ranging from the theoretical analysis of algorithms to their application in practice.

We analyze fundamental optimization problems in areas such as Railway Optimization, Bioinformatics, Robotics, and Algorithmic Game Theory; but we also seek to see this basic research be deployed in practice.

Our group is part of the Center for Algorithms, Discrete Mathematics and Optimization at the Institute of Theoretical Computer Science at ETH Zurich. The group is headed by Prof. Dr. Peter Widmayer.

SOS Seminar

You are very welcome to visit our Seminar on Algorithms, Data Structures, and Applications (SOS).

If you wish to receive email announcements of upcoming events, please subscribe to our SOS mailing list.

Talks are usually given on Mondays, 15:00 h, CAB H 52 or 53

  • 10.11.16, 14:15, CAB H 52, Stefano Leucci: Multiple-Edge-Fault-Tolerant Approximate Shortest-Path
    Trees (and Oracles) [abstract]
  • 27.10.16, 15:00, CAB H 16, Yves Frank: De Novo Sequencing with Retention Time Prediction [abstract]
  • 27.10.16, 14:15, CAB H 52, Przemysław Uznański: Lowest Common Ancestor and Range Minimum Queries in O(1) Time and O(n) Space [abstract]
  • 13.10.16, 14:15, CAB H 52, Stephan Eidenbenz: Computing at Los Alamos: A Brief Overview and Details on Codesign Performance Prediction through Just-in-time-compiled Parallel Discrete Event Simulation [abstract]
  • 11.10.16, 14:15, CAB H 52, Valentin Venzin: Improving the Accuracy of De Novo Peptide Sequencing
    using Retention Time Prediction [abstract]
  • 06.10.16, 14:15, CAB H 52, Tomáš Gavenčiak: WAVL trees: The Best from AVL and Red-Black Trees [abstract]

Please have a look at former talks.

Page URL:
Fri Dec 09 18:16:44 CET 2016
© 2016 Eidgenössische Technische Hochschule Zürich