Startseite > Fachgruppen > Algorithmen und Komplexität > Mitarbeiter > Dissertationen, Habilitationen
Dissertationen, Habilitationen
Promotionen unserer Fachgruppe
2020
- Björn Feldkord: Mobile Resource Allocation, 23.01.2020
2019
- Alexander Mäcker: On Scheduling with Setup Times, 06.11.2019
- Manuel Malatyali: Big Data: Sublinear Algorithms for Distributed Data Streams, 15.02.2019
2018
- Matthias Feldotto: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, 21.12.2018
- Daniel Jung: Local Strategies for Swarm Formations on a Grid, 13.02.2018
2017
- Sören Riechers: Scheduling with Scarce Resources, 14.11.2017
- Pavel Podlipyan: Local Algorithms for the Continuous Gathering Problem, 08.11.2017
- Shouwei Li: Parallel fixed parameter tractable problems, 12.10.2017
2016
- Max Drees: Existence and Properties of Pure Nash Equilibria in Budget Games, 27.06.2016
- Andreas Cord-Landwehr: Selfish Network Creation - On Variants of
Network Creation Games, 09.02.2016
2015
- Christine Markarian: Online Resource Leasing, 08.07.2015
- Claudius Jähn: Bewertung von Renderingalgorithmen
für komplexe 3-D-Szenen, 25.06.2015 - Sebastian Abshoff: On the Complexity of Fundamental Problems in
Dynamic Ad-hoc Networks, 27.04.2015
2014
- Peter Kling: Energy-efficient Scheduling Algorithms, 31.03.2014
- Ralf Petring: Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit, 14.02.2014
2013
- Benjamin Eikel: Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes, 18.12.2013
- Peter Pietrzyk: Local and Online Algorithms for Facility Location, 28.10.2013
2012
- Barbara Kempkes: Local strategies for robot formation problems, 17.02.2012
2011
- Tim Süß: Parallel Real-Time Rendering using Heterogeneous PC Clusters, 19.12.2011
- Sascha Effert: Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen, 10.05.2011
- Joachim Gehweiler: Peer-to-Peer Based Parallel Web Computing, 09.05.2011
2010
- Jan Mehler: Power-Aware Online File Allocation in Dynamic Networks, 30.09.2010
- Peter Mahlmann: Peer-to-Peer Networks based on Random Graphs, 13.04.2010
- Sebastian Degener: Local, distributed approximation algorithms for geometric assignment problems, 13.04.2010
2008
- Katharina Lürwer-Brüggemeier: Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division, 17.12.2008
- Mario Mense: On Fault-Tolerant Data Placement in Storage Networks, 16.12.2008
- Gunnar Schomaker: Distributed Resource Allocation and Management in Heterogeneous Networks, 16.12.2008
- Michael Kortenjan: Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, 14.11.2008
- Olaf Bonorden: Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, 30.05.2008
2007
- Jaroslaw Kutylowski: Using Mobile Relays for Ensuring Connectivity in Sparse Networks, 06.12.2007
- Miroslaw Dynia: Collective Graph Exploration, 06.12.2007
2006
- Gereon Frahling: Algorithms for Dynamic Geometric Data Streams, 18.10.2006
- Stefan Rührup: Position-based Routing Strategies, 31.08.2006
- Miroslaw Korzeniowski: Dynamic Load Balancing in Peer-to-Peer Networks, 05.05.2006
- Valentina Damerow: Average and Smoothed Complexity of Geometric Structures, 03.03.2006
2005
- Marcin Bienkowski: Page Migration in Dynamic Networks, 16.09.2005
- Jan Klein: Efficient Collision Detection for Point and Polygon Based Models, 22.07.2005
- Klaus Volbert: Geometric Spanners for Topology Control in Wireless Networks, 14.06.2005
- Matthias Fischer: Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments, 18.03.2005
2004
- Kay Salzwedel: Data Distribution Algorithms for Storage Networks, 16.07.2004
2003
- Harald Räcke: Data management and routing in general networks, 08.12.2003
2002
- Christian Sohler: Property Testing and Geometry, 18.12.2002
- Martin Ziegler: Zur Berechenbarkeit reeller geometrischer Probleme, 11.11.2002
2000
- Ingo Rieping: Communication in Parallel Systems - Models, Algorithms and Implementations, 14.11.2000
- Matthias Westermann: Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, 03.11.2000
- Klaus Schröder: Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, 12.05.2000
1999
- Tamas Lukovszki: New Results on Geometric Spanners and Their Applications, 01.10.1999
1998
- Berthold Vöcking: Static and Dynamic Data Management Networks, 18.12.1998
- Brigitte Oesterdiekhoff: On Periodic Comparator Networks, 15.05.1998
1997
- Willy-Bernhard Strothmann: Bounded Degree Spanning Trees, 19.12.1997
- Wolfgang Dittrich: Communication and I/O Efficient Parallel Data Structures, 22.08.1997
- Armin Bäumker: Communication Efficient Parallel Searching, 19.09.1997
1996
- Christian Scheideler: Universal Routing Strategies for Interconnection Networks, 18.12.1996
1995
- Foued Ameur: Space-Bounded Learning Algorithms, 20.12.1995
- Alf Wachsmann: Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher, 08.09.1995
- Artur Czumaj: Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, 30.08.1995
- Volker Stemann: Contention Resolution in Hashing Based Shared Memory Simulations, 06.07.1995
1994
- Rolf Wanka: Paralleles Sortieren auf mehrdimensionalen Gittern, 16.09.1994
Habilitationen unserer Fachgruppe
- Martin Ziegler: Real Computability and Hypercomputation, 14.3.2008
- Christian Schindelhauer: Communication Network Problems, 9.2002
- Christian Scheideler: Probabilistische Methoden für Koordinierungsprobleme, 30.06.2000
- Artur Czumaj: Randomization and Approximation Techniques for some Combinatorial Problems, 22.12.1999
- Martin Dietzfelbinger: Universal hashing in sequential, parallel, and distributed computing, 12.1992