Dear all, this is a reminder for Jürgen Giesl's talk with the title "Termination and Complexity Analysis of (Probabilistic) Programs: Results and Future Work" taking place today at 12:30 in the B-IT room 5053.2. Please find the details below --- Abstract --- We give an overview on our work on developing techniques for automated termination and complexity analysis for different kinds of programs. While automated tools for the analysis of non-probabilistic programs are already very powerful, we will indicate several research problems that have to be solved in order to obtain techniques of similar power for probabilistic programs. ---------------- Part of the programme of the research training group UnRAVeL is a series of lectures on the topics of UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is given by one of the researchers involved in UnRAVeL. This years topic is "UnRAVeL - New Ideas!". In these lectures, UnRAVeL professors will discuss current research as well as highlight open problems and offer a perspective on potential future directions. All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2024 and engage in discussions with researchers and doctoral students. We are looking forward to seeing you at the lectures. Kind regards, Jan-Christoph for the organisation committee