M.Sc. Tim Niklas Uhl
- Room: 210
- Phone: +49 721 608-45270
- Fax: +49 721 608-43088
- uhl ∂does-not-exist.kit edu
- github.com/niklas-uhl/
Publications
Communication Efficient Triangle Counting. master’s thesis
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 | Typ | Semester |
|---|---|---|
| Visualisierung von Graphalgorithmen | Praxis der Softwareentwicklung | WS 22/23 |
| Parallele Algorithmen | lecture | WS 22/23 |
| Parallele Algorithmen - Von Theorie zu Praxis | proseminar | SS 2022 |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Exploring highly-scalable Breadth-First-Search (BFS) | Verteilte Graphalgorithmen, HPC | ||
| Scalable Fault-Tolerant MapReduce | Fault-Tolerance, Map Reduce, HPC | offen |
|
| Speedup Techniques for Irregular Sparse All-to-All | Kommunikationalgorithmen, verteilte Graphalgorithmen |