PhD defenses at the Faculty of Informatics
- 24.03.2010: Online Dynamic Algorithm Portfolios
- 22.03.2010: Automatically Generated Runtime Checks for Design-Level Constraints
- 17.03.2010: Approximability of Precedence Constrained and Robust Scheduling Problems
- 15.12.2009: A Design Flow and Evaluation Framework for DPA-resistant Embedded Systems - A step towards design automation for security
- 12.10.2009: Reverse Engineering Software Ecosystems
- 09.10.2009: On Multicast Primitives in Large Networks and Partial Replication Protocols
- 12.06.2009: Approximability of Some Classical Graph and Scheduling Problems
- 27.05.2009: Compilation and Design Automation For Extensible Embedded Processors
- 14.05.2009: Teaching Networks How To Learn
- 06.05.2009: On Non-Intrusive Workload-Aware Database Replication
- 01.12.2008: Of Change And Software
- 17.06.2008: Machine Super Intelligence
- 29.04.2008: Multicoordinated Agreement Protocols and the Log Service
- 16.04.2008: Imprecise Probabilistic Graphical Models: Equivalent Representations, Inference Algorithms And Applications