László Kozma

László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures, adaptive algorithms, and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures.

• Academic Affiliation: Freie Universität Berlin (since 2018)
• Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven.

His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection, and self-adjusting heaps. Key areas include:

• Adaptive algorithms for pattern-avoiding inputs
• Optimal tree and heap structures
• Geometric and stochastic approaches to optimization
• Complexity analysis of classical algorithms

Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.