News9 October 2024|Theory of Efficient AlgorithmsSlides for the Freshmen Lecture (Winter Term 2024/25)I gave today's welcome/example lecture for our Computer Science freshmen at Hamburg. The lecture topic was, traditionally, Petri Nets (in remembrance of Prof. Dr. Carl Adam Petri, a honorary professor at the University for Hamburg whose...25 September 2024|Theory of Efficient AlgorithmsInvited Talk at WAND 2024I will be giving an invited talk at WAND 2024 (Workshop on Analysis of Networks Dynamics), one of the workshops at this year's DISC. The talk will cover recent research results on oscillators in simple distributed models with erratic...20 July 2024|Theory of Efficient AlgorithmsInvited Talk at DDays 2024I will be giving a talk on oscillator dynamics at DDays 2024 (Dynamic Days Europe). It is a large conference bringing together researchers from a wide range of different backgrounds to discuss nonlinear dynamical systems. Looking forward to...19 December 2023|Theory of Efficient AlgorithmsPaper on Resource-aware Scheduling got Best Paper Award at COCOA 2023Our paper on improved scheduling with a shared resource got the best paper award at the 16th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2023)! A preprint of the full version can be found on arXiv.11 October 2023|Theory of Efficient AlgorithmsSlides for the Freshmen Lecture (Winter Term 2023/24)I gave today's welcome/example lecture for our Computer Science freshmen at Hamburg. The lecture topic was, traditionally, Petri Nets (in remembrance of Prof. Dr. Carl Adam Petri, a honorary professor at the University for Hamburg whose...23 June 2023|Theory of Efficient AlgorithmsPaper on Scheduling with Testing Accepted at ESA 2023Our paper on scheduling under a given testing budget was accepted at the European Symposium on Algrithms 2023 (ESA 2023)! A preprint of the full version can be found on arXiv.28 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 April 2021|Theory of Efficient AlgorithmsPaper on Rectangle Packing Accepted at ICALP 2021Our paper on anchored rectangle packing was accepted at the 48th International Colloquium on Automata, Languages and Programming (ICALP 2021)! It is about an open problem by Freedman from 1969, asking whether one can always cover 50% of the...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.Show all news