László Kozma
Arbeitsgruppe Theoretische Informatik
Institut für Informatik
Freie Universität Berlin
Address:
Takustr. 9, Room 114
14195 Berlin
Germany
E-mail: laszlo.kozma@fu-berlin.de
Phone: +49 30 838 66213
Office hours:
Monday 10-11, or by e-mail appointment, or whenever my door is open.
Note: I'm happy to advise thesis projects. If you are interested in doing a thesis with me on an algorithmic topic, come by to talk. I can propose various topics or you can come with your own suggestion.
Parameterized and exact exponential algorithms, Spring 2021.
Algorithmic geometry (jointly with K. Kriegel), Spring 2021.
Advanced algorithms, Fall 2020.
Advanced data structures, Spring 2020.
[course page]
Analysis für Infomatik, Fall 2019.
Randomized algorithms, Spring 2019.
[course plan]
Advanced algorithms, Fall 2018.
[course plan]
Graph algorithms (at TU Eindhoven, jointly with J. Nederlof), Spring 2018.
I am interested in questions about data structures, algorithms, combinatorics, and algorithmic geometry. My papers (pdf downloads), slides, etc. can be found on my
personal website.
Selected publications (see here for
full list):
- Time- and space-optimal algorithm for the many-visits TSP
with André Berger, Matthias Mnich, Roland Vincze, SODA 2019.
- Smooth heaps and a dual view of self-adjusting data structures
with Thatchaphol Saranurak, STOC 2018.
- Maximum Scatter TSP in Doubling Metrics
with Tobias Mömke, SODA 2017.
- Pattern-avoiding access in binary search trees
with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak, FOCS 2015.
- Binary search trees, rectangles and patterns
PhD thesis, Saarland University, 2016.
- PhD:
- Master and Bachelor:
- Maria Hartmann
- Krisztina Szilágyi
- Benjamin Aram Berendsohn
- Qianli Wang
- Dennis Nikolaus Natusch
- Raphael Walkling
- Banafshe Sadeghi
- Kevin Kreutz
- Jonathan Gadea Harder
- Lena Strobl
- Ben Wiederhake (Uni Saarland)
DFG Project
Efficient Adaptive Data Structures, PI.
Last updated
by László Kozma.