László Kozma

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 51

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR (2024)
Jialu Hu, László Kozma
Non-adaptive Bellman-Ford: Yen's improvement is optimal. CoRR (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. SOSA (2024)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with Pattern-Avoiding Input. STOC (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. CoRR (2023)
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP (2023)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with pattern-avoiding input. CoRR (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13 (5) (2023)
Benjamin Aram Berendsohn, László Kozma
Group Testing with Geometric Ranges. ISIT (2022)
Benjamin Aram Berendsohn, László Kozma
Splay trees on trees. SODA (2022)
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
Fixed-point cycles and EFX allocations. CoRR (2022)
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
Fixed-Point Cycles and Approximate EFX Allocations. MFCS (2022)
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
Analysis of Smooth Heaps and Slim Heaps. CoRR (2021)
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
Analysis of Smooth Heaps and Slim Heaps. ICALP (2021)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. Algorithmica 83 (8) (2021)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16 (3) (2020)
László Kozma, Thatchaphol Saranurak
Smooth Heaps and a Dual View of Self-Adjusting Data Structures. SIAM J. Comput. 49 (5) (2020)
László Kozma
Exact Exponential Algorithms for Two Poset Problems. SWAT (2020)
Benjamin Aram Berendsohn, László Kozma
Geometric group testing. CoRR (2020)
Benjamin Aram Berendsohn, László Kozma
Splay trees on trees. CoRR (2020)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
A time- and space-optimal algorithm for the many-visits TSP. SODA (2019)
László Kozma
Faster and simpler algorithms for finding large patterns in permutations. CoRR (2019)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity Below Dirac's Condition. WG (2019)
László Kozma
Exact exponential algorithms for two poset problems. CoRR (2019)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. IPEC (2019)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and counting permutations via CSPs. CoRR (2019)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity below Dirac's condition. CoRR (2019)
Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA (2019)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-Finger Binary Search Trees. ISAAC (2018)
László Kozma
Review of Compact Data Structures - a practical approach by Gonzalo Navarro. SIGACT News 49 (3) (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA (2018)
László Kozma, Thatchaphol Saranurak
Smooth heaps and a dual view of self-adjusting data structures. CoRR (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
Pairing heaps: the forward variant. MFCS (2018)
Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR (2018)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-finger binary search trees. CoRR (2018)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and space-optimal algorithms for the many-visits TSP. CoRR (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR (2018)
László Kozma, Thatchaphol Saranurak
Smooth heaps and a dual view of self-adjusting data structures. STOC (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
Pairing heaps: the forward variant. CoRR (2017)
László Kozma, Tobias Mömke
Maximum Scatter TSP in Doubling Metrics. SODA (2017)
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
Hitting Set for Hypergraphs of Low VC-dimension. ESA (2016)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
The landscape of bounds for binary search trees. CoRR (2016)
László Kozma, Thatchaphol Saranurak
Binary search trees and rectangulations. CoRR (2016)
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
Hitting Set in hypergraphs of low VC-dimension. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-avoiding access in binary search trees. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
A Global Geometric View of Splaying. CoRR (2015)
László Kozma, Tobias Mömke
A PTAS for Euclidean Maximum Scatter TSP. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. WADS (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-Avoiding Access in Binary Search Trees. FOCS (2015)
Christian Konrad, László Kozma
Streaming Algorithms for Partitioning Integer Sequences. CoRR (2014)
László Kozma
Review of the tower of Hanoi: myths and maths by Andreas M. Hinz, Sandi Klavžar, Urož Milutinović and Ciril Petr. SIGACT News 45 (3) (2014)
László Kozma, Shay Moran
Shattering, Graph Orientations, and Connectivity. Electron. J. Comb. 20 (3) (2013)
Victor Alvarez, Erin W. Chambers, László Kozma
Privacy by Fake Data: A Geometric Approach. CCCG (2013)
László Kozma
Minimum Average Distance Triangulations. ESA (2012)
László Kozma, Shay Moran
Shattering, Graph Orientations, and Connectivity CoRR (2012)
László Kozma
Minimum Average Distance Triangulations CoRR (2011)
László Kozma, Arto Klami, Samuel Kaski
GaZIR: gaze-based zooming interface for image retrieval. ICMI (2009)

László Kozma.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

László Kozma