Laszlo Kozma

László Kozma is an Assistant Professor at Freie Universität Berlin in the Theoretical Computer Science department. He obtained his PhD at Saarland University under Raimund Seidel, followed by postdocs at Tel Aviv University and TU Eindhoven. His work focuses on data structures, combinatorics, and algorithmic adaptivity, with significant contributions to self-adjusting heaps, binary search trees, and geometric optimization. Recent research includes pattern-avoiding sequences and saddlepoint algorithms.

His publications span exponential algorithms, TSP variants, and heap structures, with a recurring theme of connecting combinatorial geometry to algorithm design. Co-authors include leading researchers like Robert Tarjan, Uri Zwick, and Haim Kaplan. Key software implementations (e.g., smooth heap) are publicly available.

He has developed tools like Cuckoo Hashing Visualization and the historical WikipediaVision project, demonstrating practical engagement with algorithmic concepts. His mathematical genealogy traces back to classical researchers.