Research Interests
- Concurrent datastructures
- Design of efficient algorithms
- Graph algorithms
- Automatic planning
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Engineering QuickHeaps | Engineering a fast priority queue |
| Titel | Forschungsthema | Betreuung | Bearbeitung | Typ |
|---|---|---|---|---|
| Scalable Parallel Packed Memory Arrays | Packed Memory Array,Datenstruktur,Batching,Parallelismus | |||
| Parallele Relaxierte FIFO-Queue | Parallele Datenstrukturen, Algorithmen, FIFO, Relaxierung | Marvin Williams |
Bachelor-/Masterarbeit | |
| Engineering of a Concurrent FIFO with Relaxed Semantics | Bachelorarbeit |
| Titel | Typ | Semester | Dozent |
|---|---|---|---|
| Lab: Efficient Parallel C++ | Praktikum (P) | WS 25/26 | Prof. Dr. Peter Sanders Matthias Schimek Marvin Williams Daniel Seemaier |
| Parallele Algorithmen | Vorlesung (V) | WS 20/21 | Prof. Dr. Peter Sanders Demian Hespe Daniel Funke |
| Parallele Algorithmen - Von Theorie zu Praxis | Proseminar (PS) | SS 2021 | Prof. Dr. Peter Sanders Daniel Funke Tobias Heuer Marvin Williams |
| Parallele Algorithmen | Vorlesung (V) | WS 21/22 | Prof. Dr. Peter Sanders Lukas Hübner Marvin Williams |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2022 | Prof. Dr. Peter Sanders Marvin Williams Daniel Seemaier |
| Effizientes paralleles C++ | Praktikum (P) | WS 22/23 | Prof. Dr. Peter Sanders Sascha Witt Matthias Schimek Marvin Williams |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2023 | Prof. Dr. Peter Sanders Marvin Williams Moritz Laupichler Hans-Peter Lehmann |
| Effizientes paralleles C++ | Praktikum (P) | WS 23/24 | Prof. Dr. Peter Sanders Sascha Witt Matthias Schimek Marvin Williams |