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.
Advanced algorithms, Fall 2021, Fall 2020, Fall 2018.
[course plan (2018)]
Seminar on Clustering, Fall 2021.
[course page]
Parameterized and exact exponential algorithms, Spring 2021.
[course plan]
Algorithmic geometry (jointly with K. Kriegel), Spring 2021.
Advanced data structures, Spring 2020.
[course page]
Analysis für Infomatik, Fall 2019.
Randomized algorithms, Spring 2019.
[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 and downloads):
- Splay trees on trees
with Benjamin A. Berendsohn,
SODA 2022.
- Analysis of smooth heaps and slim heaps
with Maria Hartmann, Corwin Sinnamon, Robert E. Tarjan,
ICALP 2021.
- Time- and space-optimal algorithm for the many-visits TSP
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
with Thatchaphol Saranurak,
STOC 2018, SIAM J. Comp., Vol 49(5), 2020
- 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:
- Maria Hartmann
- Krisztina Szilágyi
- Benjamin Aram Berendsohn
- Bachelor:
- Fang Lin
- Claire Alexandra Bräuer
- Christian Offner
- Florian Suhre
- Christoph Meiske
- Nazar Sopiha
- Qianli Wang
- Dennis Nikolaus Natusch
- Raphael Walkling
- Banafshe Sadeghi
- Kevin Kreutz
- Jonathan Gadea Harder
- Lena Strobl
- Ben Wiederhake (Uni Saarland)
Titles/abstracts and completed theses (where available) can be accessed through the group websites:
master |
bachelor
DFG Project
Efficient Adaptive Data Structures, 2019-2022, PI.
Last updated
by László Kozma.