Forschung
- Publikationen
-
Laufende Dissertationsprojekte
-
Algorithmen und Komplexität
- Mariia Anapolska: Robust Appointment Scheduling in Hospitals
- Katharina Eickhoff: Design and Analysis of Algorithms for Combinatorial Optimization Problems under Uncertainties
- Dennis Fischer: Optimization under Uncertainty
- Christoph Grüne: Complexity and Algorithms in Optimization under Uncertainty
- Tabea Brandt: Combinatorial Analysis of Patient-to-Room Assignment in Hospitals
- Komal Muluk: Optimization under Adversarial Uncertainty
- Michael Scholkemper: Structural Network Analysis
-
Verifikation
- Alexander Bork: Automated Verification of Partially Observable Stochastic Models
- Jan-Christoph Kassing: Analyzing Termination and Expected Runtime Complexity for Probabilistic Term Rewriting
- Fabian Meyer: Automated Complexity Analysis of Probabilistic Programs
- Jasper Nalbach: Algebraic Methods in SMT-Solving
- Jip Spel: Monotonicity in Parametric Markov Chains
- Tobias Winkler: Programming and Verifying Uncertain Phenomena
- Logik und Sprachen
-
Applikationsszenarien
- Tamme Emunds: Calculating the capacity of railway systems considering microscopic infrastructure constraints
- Qihui Feng: A Logic of Belief over Arbitrary Probability Distribution
- Nadine Friesen: Robust Infrastructure
- Carolina Gerlach: Probabilistic Hyperproperties
- Vincent Grande: Randomness and Uncertainty in Signal Processing on Topological Spaces
- Till Hofmann: Robust Execution of Abstract Task Plans on Mobile Robots
- Henrik Hose: Safe Neural Network Controller for Agile Robots
- Andreas Klinger: Privacy Preserving Online Algorithms
- Christoph Standke: Probabilites in Database Queries: Power and Complexity
-
Algorithmen und Komplexität
- Abgeschlossene Promotionen
- Abgeschlossene Bachelor- und Masterarbeiten