Research Interests
- Concurrent datastructures
- Design of efficient algorithms
- Graph algorithms
- Automatic planning
Publications
BlockFIFO & MultiFIFO: Scalable Relaxed Queues
Koch, S.; Sanders, P.; Williams, M.
2025. arxiv. doi:10.48550/arXiv.2507.22764
Koch, S.; Sanders, P.; Williams, M.
2025. arxiv. doi:10.48550/arXiv.2507.22764
The MultiQueue: A Simple and Fast Relaxed Concurrent Priority Queue
Williams, M.; Sanders, P.
2025. ACM Transactions on Parallel Computing. doi:10.1145/3771738
Williams, M.; Sanders, P.
2025. ACM Transactions on Parallel Computing. doi:10.1145/3771738
A Simple yet Exact Analysis of the MultiQueue
Walzer, S.; Williams, M.
2025. A. Benoit, H. Kaplan, S. Wild & G. Herman (Eds.), 33rd Annual European Symposium on Algorithms (ESA 2025), Warschau, 15th-17th September 2025, Art.-Nr.: 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2025.85
Walzer, S.; Williams, M.
2025. A. Benoit, H. Kaplan, S. Wild & G. Herman (Eds.), 33rd Annual European Symposium on Algorithms (ESA 2025), Warschau, 15th-17th September 2025, Art.-Nr.: 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2025.85
Engineering MultiQueues: Fast relaxed concurrent priority queues
Williams, M.; Sanders, P.; Dementiev, R.
2021
Williams, M.; Sanders, P.; Dementiev, R.
2021
Engineering MultiQueues: Fast relaxed concurrent priority queues
Williams, M.; Sanders, P.; Dementiev, R.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.81
Williams, M.; Sanders, P.; Dementiev, R.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.81
Partially Instantiated Representations for Automated Planning. master’s thesis
Williams, M.
2020. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000124309
Williams, M.
2020. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000124309
Evolutionary Graph Coloring. bachelor’s thesis
Williams, M.
2017. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000073698
Williams, M.
2017. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000073698
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Engineering QuickHeaps | Engineering a fast priority queue |
| Titel | Forschungsthema | Betreuung | Bearbeitung | Typ |
|---|---|---|---|---|
| Parallele Relaxierte FIFO-Queue | Parallele Datenstrukturen, Algorithmen, FIFO, Relaxierung | Marvin Williams |
Bachelor-/Masterarbeit | |
| Engineering of a Concurrent FIFO with Relaxed Semantics | Bachelorarbeit | |||
| Scalable Parallel Packed Memory Arrays | Packed Memory Array,Datenstruktur,Batching,Parallelismus |
| 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 |