High Performance = Innovative Computer Systems + Efficient Algorithms
High computing performance can only be achieved with a combination of powerful computer systems and algorithms that solve the given application problems as efficiently as possible. Therefore, the development of efficient algorithms has established itself as a classical branch of computer science.
In our research area, we concentrate on solutions where current technological possibilities, such as high performance computer networks, mobile wireless communication networks or systems supported by specialised hardware, pose new challenges for algorithm development.
Prof. Dr. Friedhelm Meyer auf der Heide has been retired since 1.8.2023. We therefore no longer offer Bachelor's and Master's theses or internships. From 1.8.2023, the research assistants are members of the working group of Prof. Dr. Christian Scheideler.
2019
2018
2017
Curriculum Vitae Friedhelm Meyer auf der Heide
Friedhelm Meyer auf der Heide is Full Professor of Algorithms and Complexity at the Heinz Nixdorf Institute and the Department of Computer Science in the Faculty of Electrical Engineering, Computer Science and Mathematics at Paderborn University since 1989. He received his doctorate in mathematics from the University of Bielefeld in 1981 and habilitated in computer science at the Johann Wolfgang Goethe University in Frankfurt in 1986. From 1984 to 1985, he was a visiting researcher at IBM Research in San Jose, California, USA. From 1986 to 1989, he worked as Professor of Theoretical Computer Science in Dortmund and moved from there to Paderborn. He has been retired since 2023.
In 1986, he was awarded the prize for the best habilitation at the Johann Wolfgang Goethe University in Frankfurt. In 1992, he was awarded the Leibniz Prize of the German Research Foundation together with his colleague Burkhard Monien. In 2007, he was admitted to the German Academy of Sciences "Leopoldina", in 2013 to the North Rhine-Westphalian Academy of Sciences, Humanities and the Arts and in 2017 to the German Academy of Science and Engineering (acatech). In 2021, he was awarded the SIROCCO Prize for Innovation in Distributed Computing. In 2024, he became an EATCS-Fellow.
Friedhelm Meyer auf der Heide was director of the DFG Research Training Group "Parallel Processor Networks in Production Technique " (1992-2001), the Collaborative Research Centers 376 "Massive Parallelism" (1995-2006) and 901 "On the Fly Computing" (2011-2023), as well as coordinator of the EU Integrated Project "Dynamically Evolving Large Scale Information Systems (DELIS)" (2004-2008). He has worked for the DFG in various functions, including as a member of the Review Board for Computer Science (2000-2008), the Heisenberg Committee and the DFG-DAAD program "Doctoral Studies at Universities in Germany" (2003, 2008). He was also a member of the Scientific Directorate of the Leibniz Center for Computer Science "Schloß Dagstuhl" (2005-2008) and the Advisory Board of the Max Planck Institute for Computer Science, Saarbrücken (2001-2011), as well as General Chair of the ACM Symposium Series "Parallelism in Algorithms and Architectures (SPAA)" (2007-2011), Head of the Federal Jury Mathematics/Computer Science of the Federal Competition "Jugend Forscht" (2007-2016) and Chairman of the Scientific Advisory Board of the Leibniz Center for Computer Science "Schloß Dagstuhl" (2014 - 2021). He has been a member of numerous program committees, including the SPAA, ICALP and ESA conferences.
His research interests include algorithmic and complexity-theoretic issues in parallel computing, communication and data management in networks, dynamics in networks, computer graphics algorithms, and randomization methods. He is (co-)author of over 200 publications and several patents. To date, he has supervised over 50 doctorates and 14 of his students now hold professorships.
Doctorates and habilitations of the group
2023
- Simon Pukrop: On Cloud Assisted, Restricted, and Resource Constrained Scheduling, 26.06.2023
- Till Knollman: Online Algorithms for Allocating Heterogeneous Resources, 30.05.2023
- Jannik Castenow: Local Protocols for Contracting and Expanding Robot Formation Problems, 24.05.2023
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
Habilitations
- 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
Research projects
Projects
- DigiChemLab (2020)
- OSIgoes3D
- DFG: Algorithms for Swarm Robotics: Distributed Computing meets Dynamical Systems (2021)
- DFG priority project: Distributed Data Streams in Dynamic Environments in the priority programme 1736 Algorithms for Big Data (2014)
- DFG collaborative research centre 901: On-The-Fly Computing (2011-2023)
- BMBF-Project: RESIBES: RESIlienz durch Helfernetzwerke zur BEwältigung von KriSen und Katastrophen (Resilience by Spontaneous Volunteers Networks for Coping with Emergencies and Disaster) (2016)
- EU project (IP):Foundational Research on MULTIIevel complex networks and systems (MULTIPLEX) (2012-2016)
- DFG priority project:Smart Teams: Local, Distributed Strategies for Self-Organizing Robotic Exploration Teams in the priority programme 1183 Organic Computing (2005-2011)
- EU project: Foundations of Adaptive Networked Societies of Tiny Artefacts (FRONTS) (2008-2011)
- DFG project: Interactive Model Modification, Synchronized Analysis and 3D Visualization of Parallel Discrete Event Simulation (AVIPASIA), (with W. Dangelmaier, M. Fischer, 2007-2010)
- DFG priority project: Algorithm Engineering for Problems in Computer Graphics (with M. Fischer 2007-2010) in the priority programme 1307 Algorithm Engineering
As part of the project resulting software library:
PADrend: Platform for Algorithm Development and Rendering - EU project: Algorithmic Principles for Building Efficient Overlay Computers (AEOLUS) (2005-2010)
- EU project: Dynamically Evolving Large Scale Information Systems (DELIS) (2004-2008)
- DFG project: User Supported Analysis of Material Flow Simulation in Virtual Environments (BAMSI), (with W. Dangelmaier, 2003-2007)
- DFG project: Paderborn Realltime Storage Network (PReSto) - Development of a Parallel Memory System (with U. Rückert, 2003-2005)
V:Drive – Intelligent Solutions for Storage Management - BMBF project: GigaNet-IC (with Infineon Technologies AG, Rückert, Ramacher, Kastens, 2002)
- DFG priority project: Algorithms for Large Dynamic Geometric Graphs (2001-2009) in the priority programme 1126 Algorithmics of Large and Complex Networks
- EU project: Algorithms and Complexity, Future Technologies (ALCOM-FT) (2000-2003)
- DFG priority project: Hierarchical Real-Time Algorithms: Fundamentals and Walktrough Animation (1996-2001) in the priority programme 731 Efficient Algorithms for Discrete Problems and their Applications
- DFG collaborative research centre 376 (CRC): Massive Parallelism - Algorithms, Design Methods, Applications (1995-2006)
Projects of the CRC 376 :- Central Organizational Services (Management of the CRC)
- A Realistic Theory of Efficient Parallel Algorithms
- Universal Basic Services (with B. Monien)
- Realtime capable Data Server: Scheduling, Routing, Chip Design (with B. Monien, U. Rückert, 1998-2000)
- Mobile Ad Hoc Networks (with C. Schindelhauer, U. Rückert, 2001-2006)
As part of the CRC 376 resulting software libraries:
- DFG priority project: "Complexity of Parallel Computers" in the priority programme "Data Structures and Efficient Algorithms" (with I. Wegener, 1986-1991)
Graduate schools
- NRW graduate school: International Graduate School of Dynamic Intelligent Systems
- PACE - Paderborn Institute for Advanced Studies in Computer Science and Engineering
- Graduate school: GSANS - the Paderborn Graduate School on Applied Network Science
- DFG graduate school 776: Automatic Configuration in Open Systems (2002-2005)
- DFG graduate school 693: Scientific Computing: Applied Modeling and Algorithm Development (2001-2010)
- DFG graduate school: Scientific Computing (PaSCo: Paderborn Institute for Scientific Computation, 2000-2011)
- DFG graduate school 124: Parallel Computer Networks in Production Technology (spokesman, 1995-2001)
Projects of Christian Sohler at Paderborn
- DFG priority project: Development of a Practical Theory for Clustering Algorihtms through Data-Driven Modeling and Analysis in the priority programme 1307 Algorithm Engineering (with J. Blömer, 2007-2013)
- DFG project: Algorithms for Data Streams (2006-2010)