M.Sc. Tim Niklas Uhl
- Wissenschaftlicher Mitarbeiter
- Raum: 221
- Tel.: +49 721 608-43564
- Fax: +49 721 608-43088
- uhl ∂does-not-exist.kit edu
- github.com/niklas-uhl/
Publikationen
Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076
Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. doi:10.48550/arXiv.2302.11443
Sanders, P.; Uhl, T. N.
2023. doi:10.48550/arXiv.2302.11443
Communication Efficient Triangle Counting. Masterarbeit
Uhl, T. N.
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150358
Uhl, T. N.
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150358
Faster and better nested dissection orders for Customizable Contraction Hierarchies
Gottesbüren, L.; Hamann, M.; Uhl, T. N.; Wagner, D.
2019. Algorithms, 12 (9), Art.-Nr.: 196. doi:10.3390/a12090196
Gottesbüren, L.; Hamann, M.; Uhl, T. N.; Wagner, D.
2019. Algorithms, 12 (9), Art.-Nr.: 196. doi:10.3390/a12090196
| Titel | Tagung | Datum |
|---|---|---|
| Engineering a Distributed-Memory Triangle Counting Algorithm | IPDPS 2023 |
Mai 2023 |
| Titel | Typ | Semester |
|---|---|---|
| Parallele Algorithmen | Vorlesung (V) | WS 23/24 |
| Parallele Algorithmen - Von Theorie zu Praxis | Proseminar (PS) | SS 2023 |
| Visualisierung von Graphalgorithmen | Praxis der Softwareentwicklung | WS 22/23 |
| Parallele Algorithmen | Vorlesung (V) | WS 22/23 |
| Parallele Algorithmen - Von Theorie zu Praxis | Proseminar | SS 2022 |
| Titel | Forschungsthema | Betreuung | Typ |
|---|---|---|---|
| Scalable Fault-Tolerant MapReduce | Fault-Tolerance, Map Reduce, HPC | Masterarbeit |
| Titel | Forschungsthema | Betreuung |
|---|---|---|
| Distributed List-Ranking Algorithms | Distributed Graph Algorithms | |
| Speedup Techniques for Irregular Sparse All-to-All | Kommunikationalgorithmen, verteilte Graphalgorithmen | |
| Exploring highly-scalable Breadth-First-Search (BFS) | Verteilte Graphalgorithmen, HPC |