Email address: Lkozma@gmail.com
About | Research | Projects | Misc. | Blog
I am a PhD student in Saarbrücken (Germany), interested (mostly) in algorithms and combinatorics. My advisor is Prof. Raimund Seidel. Some years ago I graduated from Helsinki University of Technology (now Aalto) in Finland, where I worked in the CIS Lab. Before that, I was an intern at SCR in Princeton and before that I studied computer science at TU Cluj in Romania. Intermittently I wrote software for various companies. Below you can find my research work and some fun projects I work(ed) on.
- NEW: Pattern-avoiding access in binary search trees (with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak), FOCS 2015. [pdf-soon]
- NEW: Greedy Is an Almost Optimal Deque (with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak), WADS 2015. [pdf]
- NEW: Self-Adjusting Binary Search Trees: What Makes Them Tick? (with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak), ESA 2015. [pdf-soon] [earlier version with partial results]
- Shattering, Graph Orientations, and Connectivity (with Shay Moran), Electronic Journal of Combinatorics, Vol 20(3), 2013. [pdf]
- Inequalities cheat sheet is a collection of important inequalities in mathematics.
- all publications ...
© mmvii-mmxv László Kozma < Lkozma@gmail.com >
Photos: Judit Vass, Varun Singh.