For more news please see the front page and the scientists' homepages.

2020

  • 26.11.2020
    Lorenz Hübschle-Schneider receives his PhD, his dissertation is entitled 'Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking'.
     
  • 08.09.2020
    Peter Sanders and Ulrich Meyer (University of Frankfurt) gave a talk at the European Symposium on Algorithms 2020 about their paper that won the "Test-of-Time"-award 2019 in March. You can find the talk here.
     
  • 10.07.2020
    The massively parallel and distributed SAT solver "mallob" by Dominik Schreiber wins the first prize of the Cloud Track of the international SAT Competition 2020 by a significant margin.
     
  • 31.03.2020
    Peter Sanders receives an ERC Advanced Grant for his project „ScAlBox – Engineering Scalable Algorithms for the Basic Toolbox“. For further information, please see the websites of the department of informatics (German only) and the European Research Council.
     
  • 16.03.2020
    The Algorithms II written exam on Friday, March 20 2020, was canceled. For further information, please see here.
     
  • March 2020

    Peter Sanders (together with Ulrich Meyer from the University of Frankfurt) will be awarded the 'Test-of-Time Award' of the European Symposium on Algorithms 2019 (ESA) at ESA 2020.

    ESA is the premier European conference on algorithms research. The ESA Test-of-Time Award (ToTA) recognizes excellent papers in algorithms research that were published in the ESA proceedings 19 to 21 years ago which are still influential and stimulating for the field today. For 2019, the Award Committee selected

    Ulrich Meyer, Peter Sanders
    Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.
    http://algo2.iti.kit.edu/sanders/papers/wmain.pdf
    Proceedings of ESA 1998, pp. 393-404.

    Also appeared in
    J. Algorithms 49(1): 114-152 (2003)
    https://www.sciencedirect.com/science/article/pii/S0196677403000762 External Link   

    Laudation of the Award Committee
    The paper presents an ingenious algorithm, dubbed Delta-stepping, for the Single-Source Shortest Path Problem (SSSP). This problem is well understood in the sequential setting (i.e., Dijkstra's algorithm) but its ubiquitous applications call for efficient parallelizations. Most of the sequential SSSP algorithms are based either on label-setting or on label-correcting methods. Label-setting algorithms, like Dijkstra's algorithm, settle at each iteration the distance label of one vertex. Label-correcting algorithms work instead by relaxing edges incident to unsettled vertices: all  labels are temporary until the final step, when they all become permanent. In spite of the great practical performance  of label-correcting methods, label-setting algorithms have been known to be asymptotically superior. In their paper,  Meyer and Sanders show how to fill this gap by presenting Delta-stepping, a new label-correcting algorithm for SSSP  which runs in optimal linear time with high probability for a large class of graphs with random edge weights. They  further provide an efficient parallel implementation of their Delta-stepping algorithm, which has been a reference method and has inspired much subsequent work in parallel algorithms for many years. 

  • 08.01.2020
    Peter Sanders was appointed PC chair for the European Symposium on Algorithms (ESA) (track B - Algorithm Engineering). ESA is the premier European conference on algorithm engineering.
     
  • 06.01.2020
    Peter Sanders was elected chair of the steering committee of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX). ALENEX is the premier North American conference on the topic and one of the most important ones worldwide.
     

2019

  • 27.12.2019
    Prof. em. Dr. Peter Deussen, one of the founders of the Department of Informatics in Karlsruhe, passed away aged 84. He was Prof. Dr. Peter Sanders' predecessor in the professorship for Theoretical Informatics. For further information please see here.
     
  • 12.12.2019
    The Gauss Centre for Supercomputing has granted 22.5 million core-hours of computing time for our project MasDA: Massively Scalable Discrete Algorithms for the Basic Toolbox.
     
  • 11.12.2019
    Sebastian Schlag receives his Phd, his dissertation is entitled 'High-Quality Hypergraph Partitioning'.


     
  • 22.11.2019
    Prof. Dr. Peter Sanders was re-elected to the DFG Review Board and received the highest number of votes. For further information please see here.
     
  • 11.09.2019
    Two current and two former members of the group win the first place of the fourth "Parameterized Algorithms and Computational Experiments Challenge" (PACE). For further information please see here (German only).


     
  • 19.06.2019
    Dr. Timo Bingmann receives the Uniserv research award 'Algorithms for efficient data processing' for his dissertation "Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools". For further information please see here (German only).


     
  • 29.05.2019
    Yaroslav Akhremtsev receives his Phd, his dissertation is entitled 'Parallel and External High Quality Graph Partition'.

2018

2017

2016

2015

2014

2013

2012

2011