|Kevin Schewior speaks at the Workshop on Approximation and Online Algorithms.||8/9 2022|
|Magnus Berg Pedersen starts as Ph.D. student.||1/9 2022|
|Florian Hoersch visits Jørgen Bang-Jensen.||29/8 2022|
|Yubao Guo visits the graph theory group.||22/8 2022|
|Lene Favrholdt receives the teaching prize.||19/8 2022|
|Rob van Stee visits the Online Algorithms group.||15/8 2022|
|Jørgen Bang-Jensen attends ICGT 2022 in Montpellier.||4/7 2022|
While in Montpellier, Bang-Jensen visited his research collaborator, Stephane Bessy, at LIRMM Université Montpellier. They continued their long-term collaboration on the structure of directed graphs.
|The Online Algorithms group represented at SWAT.||27/6 2022|
|Lene Favrholdt and Kevin Schewior at MAPSP in Italy.||16/6 2022|
The chair of the program committee was Leah Epstein (U Haifa). The other keynote speakers were Alessandro Agnetis (U Siena), Thomas Erlebach (U Durham), and Alberto Marchetti-Spaccamela (La Sapienza). In total, there were more than 100 participants. MAPSP is known for a large number of high-quality talks but also its openness and the allotted time for discussions, e.g., during the social event, which in this case was a hike through meadows with cows to a mountain lake. Kirk Pruhs (U Pittsburgh) maintains a website on the history of the workshop.
|Two postdocs join the Algorithms Group.||17/6 2022|
|MATOMIC Kick-Off.||23/5 2022|
|Kevin Schewior speaks at the Workshop on New Challenges in Scheduling Theory.||18/5 2022|
|The Online Algorithms Group invited to the Workshop on Algorithms with Predictions.||4/5 2022|
|Kevin Schewior starts as Assistant Professor in the Algorithms Group.||1/5 2022|
|The Group sends representatives to the DDC meeting.||5/4 2022|
|Simon Erfurth starts as Ph.D. student.||1/1 2022|
|DIREC Meeting at Nyborg Strand Hotel.||13/9 2021|
|Faith Ellen's student wins best doctoral dissertation award.||5/7 2021|
The committee writes:
Zhu's thesis establishes general memory lower bounds for both deterministic and randomized algorithms for a variety of basic synchronization tasks including consensus, k-set agreement, and ε-approximate agreement. These bounds hold under a weak liveness assumption—obstruction-freedom—making them very general. Among the results in the thesis one stands out. It provides a definitive solution to a classic and long-standing open problem in distributed computing: to determine the space complexity of consensus in asynchronous, shared-memory systems. Besides the significance of the result, the committee also appreciated its beautiful execution—a clean, textbook-quality proof. On the basis of this achievement the committee made its decision to assign the award to this excellent piece of work.
|Daniel Merkle and the Algorithmic Cheminformatic group receive huge grant.||7/6 2021|
Around 20 million of the grant goes to IMADA. The rest is shared by the project partners at the University of Leipzig, the University of Vienna, and the Helmholtz Centre for Environmental Research, Leipzig.
|Faith Ellen's student wins award.||8/4 2021|
In the talk, Jimmy discusses both his results without too many technical details and outlines his personal journey through his Ph.D. studies, pointing to people and circumstances of importance to him. Faith receives significant recognition of her rôle as his advisor.
Jimmy is now a postdoc at the University of Michigan.
|David Hammer defends his dissertation.||27/11 2020|
David gave a very nice presentation, Kim says, giving a good overview while also higlighting some of the deeper technical details required to establish his results. Congratulations to David, and to Rolf for having educated yet another excellent researcher.
|Daniel Merkle takes over as head of the algorithms group.||1/9 2020|
|Joan Boyar presents priority algorithms advice results at OLAWA.||28/9 2020|
|Jørgen Bang-Jensen gives a course to hundreds of Chinese students.||11/7 2020|
|Jørgen Bang-Jensen returning from sabbatical.||11/6 2020|
|The algorithms group receives two grants from FNU.||18/5 2020|
|Faith Ellen has been appointed Adjunct Professor.||1/4 2020|
Faith Ellen received her Ph.D. from the University of California, Berkeley in 1982. Since 1995, she has been a full professor at the highly ranked Department of Computer Science at the University of Toronto. Among numerous awards and prestigious chairing appointments, she became a Fellow of the ACM in 2014, a very prestigious recognition from the community.
We are delighted to welcome Faith Ellen into our group.