News28 March 2023|Theory of Efficient AlgorithmsSlides for the Master Orientation (Summer Term 2023)The slides for the presentation of the research group TEA at the master orientation for the summer term 2023 can be downloaded as a PPTX or PDF file.11 October 2022|Theory of Efficient AlgorithmsSlides for the Freshmen Lecture (Winter Term 2022/23)I'm giving tomorrow's welcome/example lecture for our Computer Science freshmen at Hamburg. It will take place in Audimax 2. The lecture topic is traditionally Petri Nets (in remembrance of Prof. Dr. Carl Adam Petri, a honorary professor at...20 July 2022|Theory of Efficient AlgorithmsPaper on Exact Plurality Consensus at PODC 2022Earlier this year, our paper on exact plurality consensus was accepted at the 41th ACM Symposium on Principles of Distributed Computing (PODC 2022). We show how a fairly natural population protocol for plurality consensus can beat known...10 February 2022|Theory of Efficient AlgorithmsCongratulations to Christiane for the Successful Defense of Her ThesisAll the best to Christiane, who successfully defended her dissertation today and attained her Ph.D.! While still supervised by Maria Knobelsdorf from the University of Vienna, Christiane was an associated Ph.D. candidate at my group for...6 October 2021|Theory of Efficient AlgorithmsSlides for the Freshmen Lecture (Winter Term 2021/22)I gave this year's welcome/example lecture for our Computer Science freshmen at Hamburg. The lecture topic is traditionally Petri Nets (in remembrance of Prof. Dr. Carl Adam Petri, a honorary professor at the University for Hamburg whose...2 October 2021|Theory of Efficient AlgorithmsPaper on Fast Consensus Forming Accepted at SODA 2022Our paper on fast consensus in synchronous and asynchronous agent systems was accepted at the 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)! A (not yet completely updated) preprint of the full version can be found on arXiv.21 November 2020|Theory of Efficient AlgorithmsBest Paper Award at SSS 2020We won the Best Paper Award at the 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2020)! Thanks to my co-authors Jannik, Till and Friedhelm for the great collaboration. You can find the full...12 October 2020|Theory of Efficient AlgorithmsSlides for the Schnupperstudium (Winter Term 2020/21)(German talk for students to get a glimpse of what it is like to study Computer Science.) Hier findet ihr meine Folien zum heutigen Probevorlesung im Schnupperstudium als PPTX und PDF Datei. Die Probevorlesung ging bis Folie 34. Die...16 June 2020|Theory of Efficient AlgorithmsSTOC and TEA-RS TalkNext Monday I’ll be giving a short (5 min) virtual talk about our current STOC paper on leader election in the population protocol model (preprint available on HAL Inria). Hope to see you there! If you’re interested, you can access the full...12 December 2019|Theory of Efficient AlgorithmsTEA Research SeminarYou can now subscribe to our TEA-RS mailinglist (https://mailhost.informatik.uni-hamburg.de/mailman/listinfo/tea-researchseminar) to receive updates and talk announcements concerning the TEA research seminar (jointly with the ART group).8 October 2019|Theory of Efficient AlgorithmsSlides for the Master Orientation (Winter Term 2019/20)The slides for the presentation of the research group TEA at the master orientation for the winter term 2019/20 can be downloaded as a PPTX or PDF file.3 May 2019|Theory of Efficient AlgorithmsLooking for PhD StudentsThe Theoretical Computer Science working groups ART and TEA are looking for Ph.D. candidates. Potential candidates are encouraged to contact Prof. Dr. Peter Kling. Further details can be found in the official job advertisment both in...27 March 2019|Theory of Efficient AlgorithmsSlides for the Master Orientation (Summer Term 2019)The slides for the presentation of the research group TEA at the master orientation for the summer term 2019 can be downloaded as a PPTX or PDF file.9 October 2018|Theory of Efficient AlgorithmsSlides for the Master Orientation (Winter Term 2018/19)The slides for the presentation of the research group TEA at the master orientation for the winter term 2018/19 can be downloaded as a PPTX or PDF file.30 August 2018|Theory of Efficient AlgorithmsUHH-UChile TCS Workshop 2018We organize a research workshop together with Andreas Wiese from the University of Chile from September 3rd to September 7th. More details can be found on the workshop's homepage.8 June 2018|Theory of Efficient AlgorithmsInaugural LectureI will give my inaugural lecture on Monday, June 11th at the Informatikum in Hamburg (Konrad Zuse Hörsaal, B-201). The lecture starts at 5:15 pm. Everybody is welcome to join both the lecture itself and the reception with some food and...25 May 2018|Theory of Efficient Algorithms1. Bremen-Hamburg Workshop on Algorithms, Combinatorics, and OptimizationTogether with Petra Berenbrink (Universität Hamburg) and Nicole Megow (University of Bremen) we are organizing the 1. Bremen-Hamburg Workshop on Algorithms, Combinatorics, and Optimization. The goal is to bring together researchers with a...16 May 2018|Theory of Efficient AlgorithmsNew Team Member: Christoph DameriusWe welcome our new team member Christoph Damerius. Christoph will recently graduated from the University of Rostock. Among others he will be working on graph exploration and resource allocation problems.1 May 2018|Theory of Efficient AlgorithmsWinners from Hamburg at the CAU-FLS Programming ContestThe final phase of the 4th CAU-FLS Programming Contest was held on April 26th 2018, hosted by the Christian-Albrechts-Universität zu Kiel and the software company Fast Lean Smart from Heikendorf. This year marked the first time that –...5 April 2018|Theory of Efficient AlgorithmsTheory & Programming Contest with CAU KielWe are helping with the organization of a Theory & Programming contest of the Christian-Albrechts-Universität zu Kiel. Apart from fame and honor you can win a prize money of up to 6.000 EUR! The contest's task stems right from a practical...Show all news