Theses
In addition to the theses advertised on this page, we usually have additional flexible topics for qualification theses. Just approach a group member, mention your areas of interest and fix a date to talk about possible theses.
| Title | Subject | Supervisor | Type |
|---|---|---|---|
| Parallelisierung von interprozeduraler Programmanalyse | Martin Mohr IPD Snelting |
Masterarbeit | |
| Verlustbehaftete Kompression von Klimadaten mit Machine Learning | Prof. Dr. Peter Sanders |
Masterarbeit | |
| Automating SAT Solver Research | Data-Driven Automatic and Optimal Evaluation of SAT Solvers | Markus Iser, Jakob Bach |
Masterarbeit |
| Distributed Suffix Sorting | Distributed Suffix Sorting | Matthias Schimek, Florian Kurpicz |
Masterarbeit |
| Scalable Fault-Tolerant MapReduce | Fault-Tolerance, Map Reduce, HPC | Masterarbeit | |
| Data-Redistribution for Malleable Algorithms | Malleability, HPC | Masterarbeit | |
| Improving Graph Indices for Nearest Neighbor Search | Nearest Neighbor Search, Graph Algorithms | Lars Gottesbüren |
Masterarbeit |
| Relaxed Priority Queues with Dynamic Quality | Relaxed Priority Queues with Dynamic Quality | Masterarbeit | |
| LCP-Array Construction in Distributed Memory | String/Distributed Algorithms | Masterarbeit | |
| Wavelet Tree Construction on the GPU | Succinct Data Structures | Masterarbeit | |
| Ruleset Complexity Analysis in a Constraint-based Product Configurator | SAT-based Product Configuration | Dr. Tomas Balyo, Dr. Markus Iser |
Externe Masterarbeit |
| Master Thesis: A Novel SAT Solver Architecture | A Novel SAT Solver Architecture | Markus Iser, Tomas Balyo |
External Master Thesis |
| Scalable Resolution of NP-hard Problems | Parallel and distributed algorithms, SAT Solving, automated planning | Bachelor-/Masterarbeit |
| Title | Graduand | Supervisor | Year | Type |
|---|---|---|---|---|
| Accelerating Minimal Perfect Hash Function Construction using GPU Parallelization | Stefan Hermann |
November 2023 | Masterarbeit | |
| Improving Vehicle Detour in Dynamic Ridesharing using Transfer Stops | Max Willich |
Moritz Laupichler |
Oktober 2023 | Masterarbeit |
| Heuristische Optimierung der globalen Zielfunktion im dynamischen Ridesharing | Kevin Frisen |
Moritz Laupichler, Peter Sanders |
August 2023 | Bachelorarbeit |
| Engineering Succinct Predecessor Data Structures | Jan Benedikt Schwarz |
July 2023 | Masterarbeit | |
| Automated Tuning and Portfolio Selection for SAT Solvers | Tobias Fuchs |
Dr. Markus Iser |
Mai 2023 | Masterarbeit |
| Compressed Bit Vectors with Rank and Select Support | Tobias Paweletz |
March 2023 | Bachelorarbeit | |
| Star Partitioning - Improving Multilevel Graph Partitioning Using Peripheral Nodes | Nikolai Maas |
Tobias Heuer |
Februar 2023 | Masterarbeit |
| Evaluation of Local Search Heuristics for Graph Partitioning with Large k | Cedrico Knoesel |
Lars Gottesbüren, Tobias Heuer, Daniel Seemaier |
Juli 2022 | Bachelorarbeit |
| A Sweepline Algorithm for Calculating the Isolation of Mountains | Nicolai Hüning |
Daniel Funke, Peter Sanders |
Juli 2022 | Bachelorarbeit |
| Engineering Optimal Solvers for Rubik's Cubes | Tan Grumser |
Peter Sanders, Dominik Schreiber |
May 2022 | Bachelorarbeit |
| K-Means in a Malleable Distributed Environment | Michael Dörr |
Dominik Schreiber |
May 2022 | Bachelorarbeit |
| Heuristics for Tour Planning of Last-Mile Parcel Deliveries by Cargo Bikes | Alexander von Heyden |
Peter Sanders, Peter Vortisch (IVF), Jelle Kübler (IVF) |
April 2022 | Bachelorarbeit |
| Perfect Hash Function Generation on the GPU | Dominik Bez |
Masterarbeit | ||
| Pruning Techniques for Lifted SAT Based Hierarchical Planning | Nikolai Schnell |
Peter Sanders, Dominik Schreiber |
December 2021 | Masterarbeit |
| Asynchronous n-Level Hypergraph Partitioning | Moritz Laupichler |
Peter Sanders, Tobias Heuer, Lars Gottesbüren (ITI Wagner) |
November 2021 | Masterarbeit |
| Fast and Space Efficient Wavelet Tree Construction | Marcel Hollerbach |
Masterarbeit | ||
| Engineering of Algorithms for Very Large k Partitioning | Manuel Haag |
Peter Sanders, Tobias Heuer, Daniel Seemaier |
September 2021 | Bachelorarbeit |
| Asynchronous Clause Exchange for Malleable SAT Solving | Malte Sönnichsen |
Dominik Schreiber, Markus Iser |
August 2021 | Masterarbeit |
| Lossy Compression of Climate Data using Convolutional Autoencoders | Silke Teresa Donayre Holtz |
Peter Sanders, Uğur Çayoğlu, Pascal Friederich |
August 2021 | Masterarbeit |
| Scalable Decentralized Fault-Tolerant MapReduce for Iterative Algorithms | Charel Mercatoris |
Peter Sanders, Demian Hespe, Lukas Hübner |
August 2021 | Masterarbeit |
| Community Detection in Hypergraphs with Application to Partitioning | Robert Krause |
Peter Sanders, Tobias Heuer, Lars Gottesbüren (ITI Wagner) |
Juni 2021 | Bachelorarbeit |
| Communication Efficient Triangle Counting | Tim Niklas Uhl |
Peter Sanders, Sebastian Lamm |
Juni 2021 | Masterarbeit |
| Cube&Conquer-inspired Malleable Distributed SAT Solving | Maximilian Schick |
Peter Sanders, Dominik Schreiber |
April 2021 | Master Thesis |
| Superscalar Sample Queue: Engineering a Distribution-Based Priority Queue | Raphael von der Grün |
Peter Sanders |
April 2021 | Master thesis |
| Parallel Weighted Random Sampling - Alias Tables on the GPU | Hans-Peter Lehmann |
Peter Sanders, Carsten Dachsbacher, Lorenz Hübschle-Schneider, Emanuel Schrade |
December 2020 | Master thesis |
| Recognition of Constraints in CNF Formulas | Robin Link |
Peter Sanders, Markus Iser |
October 2020 | Bachelor Thesis |
| Improved Branching Strategies for Maximum Independent Sets | Christian Schorr |
Demian Hespe, Sebastian Lamm, Peter Sanders |
September 2020 | Bachelor Thesis |
| Using Predicated Instructions in Oblivious Data Structures | Jakob Nedlin |
Dennis Hofheinz, Peter Sanders |
June 2020 | Masterarbeit |
| Load-Balance and Fault-Tolerance for Massively Parallel Phylogenetic Inference | Lukas Hübner |
Alexandros Stamatakis, Peter Sanders, Alexey Kozlov, Demian Hespe |
June 2020 | Master Thesis |
| Engineering Generalized Reductions for the Maximum Weight Independent Set Problem | Alexander Gellner |
Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij |
June 2020 | Master Thesis |
| Kommunikationseffizientes Branch-and-Bound für das Rucksackproblem | Collin Lorbeer |
Lorenz Hübschle-Schneider |
April 2020 | Bachelorarbeit |
| A Parallel Network Flow-Based Refinement Techinque for Multilevel Hypergraph Partitioning | Lukas Reister |
Tobias Heuer |
April 2020 | Masterarbeit |
| Machine-Learning based Hypergraph Pruning for Partitioning | Tobias Fuchs |
Christian Schulz Daniel Seemaier Tobias Heuer |
March 2020 | Bachelorarbeit |
| Acyclic n-Level Hypergraph Partitioning | Daniel Seemaier |
Christian Schulz, Peter Sanders, Sebastian Schlag |
02.03.2020 | Masterarbeit |
| Multilevel Hypergraph Partitioning with Vertex Weights Revisited | Nikolai Maas |
Sebastian Schlag Tobias Heuer |
February 2020 | Bachelorarbeit |
| Communication Optimization by Data Replication for Distributed Graph Algorithms | Tobias Ribizel |
Dr. Christian Schulz |
September 2019 | Masterarbeit |
| Partially Instantiated Representations for Automated Planning | Marvin Williams |
Dominik Schreiber |
September 2019 | Masterarbeit |
| PASAR – Planning as Satisfiability with Abstraction Refinement | Nils Froleyks |
Tomáš Balyo, Dominik Schreiber |
September 2019 | Masterarbeit |
| Cube&Conquer-inspired Techniques for Parallel Automated Planning | Jean-Pierre von der Heydt |
Tomáš Balyo, Dominik Schreiber |
August 2019 | Bachelorarbeit |
| Distributed String Sorting Algorithms | Matthias Schimek |
2019-07-08 | Masterarbeit | |
| Using Per-Cell Data to Accelerate Open Addressing Hashing Schemes | Jan Benedikt Schwarz |
Tobias Maier |
May 2019 | Bachelorarbeit |
| Engineering Faster Sorters for Small Sets of Items | Jasper Marianczuk |
2019-05-09 | Bachelorarbeit | |
| Throughput Optimization in a Distributed Database System via Hypergraph Partitioning | Patrick Firnkes |
Sebastian Schlag |
April 2019 | Masterarbeit |
| Concurrent Dynamic Quotient Filters: Packing fingerprints into atomics | Robert Williger |
Tobias Maier |
March 2019 | Masterarbeit |
| A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem | Damir Ferizovic |
Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
March 2019 | Master Thesis |
| Compression Techniques for SAT Formula Descriptions | Jens Manig |
December 2018 | Bachelorarbeit | |
| Distributed Kernelization for Independent Sets | Tom George |
Peter Sanders, Demian Hespe, Sebastian Lamm |
November 2018 | Bachelor Thesis |
| An Approximate Distance Oracle for Social Networks | Katharina Flügel |
Prof. Dr. Peter Sanders |
2018 | Bachelorarbeit |
| Relaxed Priority Queues: Using buffers to guarantee quality | Holger Ebhart |
Tobias Maier |
September 2018 | Masterarbeit |
| SAT Solving with distributed local search | Guangping Li |
Tomas Balyo |
2018 | Masterarbeit |
| Windowed Bloom Filter: A new approach to growing | Samuel Kalbfleisch |
Tobias Maier |
August 2018 | Bachelorarbeit |
| Algorithm Configuration for Hypergraph Partitioning | Clemens Öhl |
Peter Sanders, Sebastian Schlag, Christian Schulz |
31.05.18 | Bachelorarbeit |
| Support Vector Machines via Multilevel Label Propagation | Matthias Schmitt |
Peter Sanders, Sebastian Schlag, Christian Schulz |
25.06.18 | Bachelorarbeit |
| Combining Recursive Bisection and k-way Local Search for Hypergraph Partitioning | Charel Mercatoris |
Peter Sanders, Sebastian Schlag, Christian Schulz |
09.11.2018 | Bachelorarbeit |
| Parallel Optimal Longest Path Search | Kai Fieger |
Tomas Balyo |
November 2018 | Masterarbeit |
| Hierarchical Task Network Planning Using SAT Techniques | Dominik Schreiber |
Humbert Fiorino, Damien Pellier, Tomas Balyo |
2018 | Masterarbeit |
| Hierarchical Task Network Planning Using SAT Techniques | Dominik Schreiber |
Humbert Fiorino, Damien Pellier, Tomas Balyo |
2018 | Masterarbeit |
| Load Balancing für Parallele Delaunay-Triangulierung | Vincent Winkler |
Daniel Funke |
2018 | Bachelorarbeit |
| Parallelizing Graphplan | Patrick Hegemann |
Tomas Balyo |
2018 | Bachelorarbeit |
| Engineering a Compact Bit-Sliced Signature Index for Approximate Search on Genomic Data | Florian Gauger |
Peter Sanders, Timo Bingmann, Simon Gog |
2018-02-14 | Masterarbeit |
| High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations | Tobias Heuer |
Peter Sanders, Sebastian Schlag |
05.01.2018 | Masterarbeit |
| Evolutionary Hypergraph Partitioning | Robin Andre |
Peter Sanders, Sebastian Schlag, Christian Schulz |
29.11.2017 | Bachelorarbeit |
| Constructing Cuckoo Hash Tables Independent of Their Load Factor | Henning Schulze |
Tobias Maier |
November 2017 | Bachelorarbeit |
| Better Recursive Graph Bisection | Yani Kolev |
Peter Sanders, Sebastian Schlag, Christian Schulz |
02.11.2017 | Bachelorarbeit |
| Engineering Graph Partitioning Algorithms to Minimize Communication Volume | Daniel Seemaier |
Peter Sanders, Sebastian Schlag, Christian Schulz |
08.11.2017 | Bachelorarbeit |
| Smart Local Search in Hypergraph Partitioning | Orlin Kolev |
Peter Sanders, Sebastian Schlag |
30.10.2017 | Diplomarbeit |
| Graph-theoretische Charakterisierung von Metropolregionen | Friedrich Schroedter |
Daniel Funke |
2017 | Diplomarbeit |
| Incremental SAT Solving for SAT Based Planning | Stephan Gocht |
Tomas Balyo |
Masterarbeit | |
| A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees | Wei Zhou |
Peter Sanders |
30.03.2017 | Masterarbeit |
| Massively Parallel 'Schizophrenic' Quicksort | Armin Wiebigke |
Michael Axtmann, Peter Sanders |
28.02.2017 | Bachelorarbeit |
| Using an Algorithm Portfolio to Solve Sokoban | Nils Froleyks |
Tomas Balyo |
23.2.2017 | Bachelorarbeit |
| Scalable Kernelization for the Maximum Independent Set Problem | Demian Hespe |
Peter Sanders, Christian Schulz, Darren Strash |
January 2017 | Masterarbeit |
| Communication Efficient Algorithms for Generating Massive Networks | Sebastian Lamm |
Peter Sanders, Christian Schulz, Darren Strash |
Masterarbeit | |
| Solving the Graph Coloring Problem with Cooperative Local Search | Guangping Li |
Tomas Balyo |
Bachelorarbeit | |
| Bloom Filters for GroupBy ReduceBy and Join in Thrill | Alexander Noe |
Timo Bingmann |
2017-01-10 | Masterarbeit |
| Evolutionary Graph Coloring | Marvin Williams |
Christian Schulz, Darren Strash |
9.1.2017 | Bachelorarbeit |
| Using Graph Partitioning to Accelerate Longest Path Search | Kai Fieger |
Tomas Balyo, Peter Sanders |
7.11.2016 | Bachelorarbeit |
| Evolutionary k-way Node Separators | Robert Williger |
Peter Sanders, Christian Schulz, Darren Strash |
6.11.2016 | Bachelorarbeit |
| A Practical Implementation of Parallel Ordered Sets and Maps with just Join | Daniel Ferizovic |
Peter Sanders |
10.03.2016 | Bachelorarbeit |
| Verschnittoptimierung für zweidimensionale Prototypenfertigungsprozesse | Jonas Fuchs |
Peter Sanders |
18.12.2015 | Masterarbeit |
| How to Partition a Graph When You Think Like A Vertex | Jan Ebbing |
Peter Sanders, Christian Schulz, Darren Strash |
||
| Boosting Local Search for the Maximum Independent Set Problem | Peter Sanders, Christian Schulz, Darren Strash |
|||
| Parallel Lightweight Wavelet-Tree, Suffix-Array and FM-Index Construction | Julian Labeit |
Peter Sanders |
02.11.2015 | Bachelorarbeit |
| Engineering Initial Partitioning Algorithms for direct k-way Hypergraph Partitioning | Tobias Heuer |
Peter Sanders, Sebastian Schlag |
25.08.2015 | Bachelorarbeit |
| Engineering Fully-Compressed Suffix Trees | Christian Ocker |
Peter Sanders |
29.05.2015 | Masterarbeit |
| Label Propagation for Hypergraph Partitioning | Vitali Henne |
Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz |
Masterarbeit | |
| In-depth look at LU-decomposition on modern multi-socket hardware | Tobias Maier |
Jochen Speck |
20.03.2015 | Masterarbeit |
| Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks | Damir Ferizovic |
Peter Sanders |
25.02.2015 | Bachelorarbeit |
| Application of Efficient Matrix Inversion to the Decomposition of Hierarchical Matrices | Moritz Klammler |
Jochen Speck |
11.11.2014 | Bachelorarbeit |
| Application of Efficient Matrix Inversion to the Decomposition of Hierarchical Matrices | Moritz Klammler |
Jochen Speck |
11.11.2014 | Bachelorarbeit |
| Communication Efficient Algorithms for Distributed OLAP Query Execution | Demian Hespe |
Peter Sanders |
30.10.2014 | Bachelorarbeit |
| Finding Small Node Separators | Michael Wegner |
Christian Schulz, Peter Sanders |
2014-10-02 | Bachelorarbeit |
| Coloring Complex Networks | Klaus Lukas Hübner |
2014-09-30 | Bachelorarbeit | |
| Evolutionary Algorithms For Independent Sets | Sebastian Lamm |
Christian Schulz, Peter Sanders |
Bachelorarbeit | |
| Speeding up Maximum Flow Computations on Shared Memory Platforms | Niklas Baumstark |
Peter Sanders |
20.10.2014 | Bachelorarbeit |
| Bulk-Parallel Priority Queue in External Memory | Thomas Keh |
Timo Bingmann |
2014-07-11 | Bachelor Thesis |
| Parallel Multiway LCP-Mergesort | Andreas Eberle |
2014-05-15 | Bachelor Thesis | |
| Engineering an Efficient Reachability Algorithm for Directed Graphs |
Florian Merz |
Peter Sanders |
9. Dezember 2013 | Diplomarbeit |
| Graphpartitionierung zur Berücksichtigung des Straßengraphen in der Gebietsplanung |
Andreas Wagner |
Peter Sanders, Nitin Ahuja, Christian Schulz |
20. Dezember 2013 | Diplomarbeit |
| A Compact Cache-Efficient Function Store with Constant Evaluation Time | Wei Zhou |
Peter Sanders, Ingo Müller |
05.11.2013 | Bachelorarbeit |
| Faster Full-Text Search through Document Clustering | Jonathan Dimond |
28.08.2013 | Diplomarbeit | |
| Distributed Duplicate Removal | Sebastian Schlag |
Peter Sanders, Ingo Müller |
10.07.2013 | Masterarbeit |
| Parallel Triplet Finding for Particle Track Reconstruction | Daniel Funke |
2013-06-21 | Masterarbeit | |
| Engineering Parrallel Bi-Criteria Shortest Path Search | Stephan Erb |
Moritz Kobitzsch Peter Sanders |
Masterarbeit | |
| Lempel-Ziv Compressed String Dictionaries | Julian Arz |
2013 | Diplomarbeit | |
| External Batched Range Minimum Queries and LCP Construction | Daniel Feist |
2013-04-11 | Bachelorarbeit | |
| Towards Mobile Time-Dependent Route Planning | Harris Kaufmann |
2013-03-15 | Bachelorarbeit | |
| Perf. Optimization of Parallel LB Fluid Flow Simulations on Complex Geometries |
Jonas Fietz |
Vincent Heuveline, Mathias Krause, Peter Sanders, Christian Schulz |
Dezember 2011 | |
| Engineering Fast Parallel Matching Algorithms |
Marcel Birn |
|||
| n-Level Hypergraph Partitioning |
Florian Ziegler |
Vitaly Osipov, Peter Sanders, Christian Schulz |
laufend | |
| String Samplesort | Sascha Denis Knöpfle |
2012-11-14 | Bachelorarbeit | |
| Schnelle Berechnung von Alternativgraphen | Marcel Radermacher |
Moritz Kobitzsch Dennis Schieferdecker |
2012 | Bachelorarbeit |
| Verbotene Muster | Bachelor- oder Masterarbeit | |||
| Exascale Ready Work-Optimal Matrix Inversion | Raoul Steffen |
2011 | Diplomarbeit | |
| Engineering Edge Ratings and Matching Algorithms for MGP |
Maximilian Schuler |
Peter Sanders, Christian Schulz |
Dezember 2011 | |
| Paralleles Sortieren als malleable Job | Patrick Flick |
2011 | Bachelorarbeit | |
| Matrix Operations for STXXL | Raoul Steffen |
J. Singler |
2010 | Studienarbeit |
| Job-Scheduling in Main-Memory Based parallel Database Systems | Jochen Seidel |
Jonathan Dees, Jochen Speck |
2010 | Diplomarbeit |
| Efficient Geocoding Algorithms | D. Karch |
2010 | Diplomarbeit | |
| GPU algorithms for comparison-based sorting and for merging based on multiway selection | N. Leischner |
V. Osipov |
2010 | Diplomarbeit |
| PCA-Based Compression of Travel Time Functions | Marc Schmitzer |
, J. Speck |
2010 | Diplomarbeit |
| Prozess-Scheduling in einem eindimensionalen Prozessorarray | Jochen Seidel |
2010 | Studienarbeit | |
| Fast and Exact Mobile Navigation with OpenStreetMap Data | Christian Vetter |
2010 | Diplomarbeit | |
| Computing Alternative Routes in Road Networks | Jonathan Dees |
2009 | Diplomarbeit | |
| Planung energieeffizienter Routen in Straßennetzwerken | Sabine Neubauer |
2009 | Diplomarbeit | |
| Distributed Parallel Time Dependent Contraction Hierarchies | Tim Kieritz |
2009 | Diplomarbeit | |
| Route Planning with Flexible Objective Functions | Moritz Kobitzsch |
R. Geisberger |
2009 | Diplomarbeit |
| Scheduled all to all communication with MPI | Ingmar Wirths |
P. Sanders |
2009 | Studienarbeit |
| Developing high performance extensible transportation planning algorithm based on OSGI | Jun Long |
P. Sanders |
2009 | Diplomarbeit |
| Parallel Time-Dependent Contraction Hierarchies | Christian Vetter |
G.V. Batz |
2009 | Studienarbeit |
| Mehrstufiges Clustering-Verfahren zur Komponentenreduktion von Gaußmischdichten | Dominik Itte |
D. Schieferdecker, M. Huber (ISAS) |
Studienarbeit | |
| Scalable parallel refinement of graph partitions | Christian Schulz |
P. Sanders |
Diplomarbeit | |
| Space Efficient Approximation of Piecewise Linear Functions | Sabine Neubauer |
G.V. Batz |
2009 | Studienarbeit |
| A multicore-parallel priority queue implementation | Marius Elvert |
J. Singler |
2009 | Studienarbeit |
| Nächster-Nachbar-Suche mittels Knotenhierarchie in der Delaunay-Triangulierung | Marcel Birn |
J. Singler |
2009 | Studienarbeit |
| Finding Important Edges for Routing in Networks | Martin Wolff |
M. Houle (NII Tokio), P. Sanders |
2008 | Diplomarbeit |
| Solution algorithms for reverse convex programs with applications to airline planning | Hui Ma |
P. Sanders, C. Schön (WIOR) |
Diplomarbeit | |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | Robert Geisberger |
D. Schultes |
2008 | Diplomarbeit |
| Effizientes Starten und Verteilen von Threads auf Mehrkern-Prozessoren | Jakob Blomer |
J. Singler |
2008 | Diplomarbeit |
| Effiziente kantenbasierte Routenplanung | Lars Volker |
D. Schultes |
2008 | Studienarbeit |
| Implementierung einer I/O-effizienten Hash-Tabelle | Markus Westphal |
R. Dementiev |
2008 | Studienarbeit |
| Better Approximation of Betweeness Centrality | Robert Geisberger |
D. Schultes |
2008 | Studienarbeit |
| Parallelization of Highway-Node Routing | Manuel Holtgrewe |
J. Singler |
2008 | Studienarbeit |
| Verteiltes externes Sortieren | Tim Kieritz |
J. Singler |
2008 | Studienarbeit |
| Parallele Konstruktion von Suffix-Tabellen | Fabian Kulla |
P. Sanders | 2006 | Diplomarbeit |
| Visualisierung sehr großer Graphen | Timo Fabian Horst Bingmann |
P. Sanders, D. Schultes | 2006 | Studienarbeit |
| Konstruierung von Suffixarrays in PL/SQL | Eric Ndengang Foyet |
P. Sanders, R. Dementiev |
2006 | Studienarbeit |
| Optimizing File Access via Ordering und Caching | Jan Wassenberg |
P. Sanders | 2006 | Studienarbeit |
| Textkompression mittels globaler Analyse | Johannes Singler |
P. Sanders | 2005 | Diplomarbeit |
| Partitionierung großer Graphen | Karsten Sperling |
P. Sanders | 2005 | Diplomarbeit |
| Suchalgorithmen auf SIMD-Rechnern – Weitere Ergebnisse zu Polyautomaten | Peter Sanders |
Prof. em. Dr. Roland Vollmar |
1994 | Diplomarbeit |