László Kozma
Location
Address:
Room 3019, Andreas-Pfitzmann-Bau (APB)
Nöthnitzer Str. 46
01187 Dresden
Germany
E-mail: laszlo.kozma@tu-dresden.de
Phone: +49 351 463-38232
Professur für Algorithmik
Institut für Theoretische Informatik
Fakultät Informatik
Technische Universität Dresden
Office hours: [to-be-fixed], or by e-mail appointment, or whenever my door is open.
Note: I'm happy to discuss possible thesis topics, usually related to algorithms and theoretical computer science. If you are interested in doing a thesis project with me, feel free to come by.
Websites: group page | personal page
News and activities
NEW: We are looking for a motivated PhD student with strong interest and background in algorithms and data structures to join our group. Get in contact or apply here if you are interested.
Teaching
Visit our group teaching pages for current information.
For courses I taught at FU Berlin, visit my previous work page.
Research
I am interested in efficient data structures and algorithms, algorithmic adaptivity, and algorithmic questions involving combinatorial and geometric structures. My papers (pdf downloads, slides, etc.) can be found on my personal website.Selected publications (see here for full list and downloads):
- Optimization with pattern-avoiding input [pdf]
with Benjamin A. Berendsohn, Michal Opler
STOC 2024.
- Fast approximation of search trees on trees with centroid trees [pdf]
with Benjamin A. Berendsohn, Ishay Golinsky, Haim Kaplan
ICALP 2023.
- Splay trees on trees [pdf]
with Benjamin A. Berendsohn,
SODA 2022.
- Analysis of smooth heaps and slim heaps [pdf]
with Maria Hartmann, Corwin Sinnamon, Robert E. Tarjan,
ICALP 2021.
- Time- and space-optimal algorithm for the many-visits TSP [pdf]
with André Berger, Matthias Mnich, Roland Vincze,
SODA 2019, ACM Trans. Alg., Vol 16(3), 2020
- Smooth heaps and a dual view of self-adjusting data structures [pdf]
with Thatchaphol Saranurak,
STOC 2018, SIAM J. Comp., Vol 49(5), 2020
- Maximum scatter TSP in doubling metrics [pdf]
with Tobias Mömke,
SODA 2017.
- Pattern-avoiding access in binary search trees [pdf]
with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak,
FOCS 2015.
- Binary search trees, rectangles and patterns [pdf]
PhD thesis, Saarland University, 2016.
Advised students and postdocs
- PhD:
- Junqi Tan (since 2024, FU Berlin)
- Benjamin Aram Berendsohn (2024, FU Berlin, thesis-link), next: MPI Saarbrücken
- Postdoc:
- Richard Mörbitz (TU Dresden)
- Justin Dallant (TU Dresden)
For bachelor and master theses I advised at FU Berlin between 2018--2025, visit my previous work page.
Misc.
Some potentially useful tips for tcs and math research and writing (R O'Donnell), talks (K Fatahalian), more on talks (A Gupta), research in general (DP Stern) and some timeless advice from G-C Rota, more advice from J. Baez, as well as from W. Thurston.Last updated by László Kozma.