László Kozma

72 papers A* 8A 7B 8Journal 43Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fast and simple multiplication of bounded twin-width matrices. CoRR László Kozma, Michal Opler
2025	J	`jnl`	Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191). Dagstuhl Reports Michael A. Bender, John Iacono, László Kozma, Eva Rotenberg, Justin Dallant
2025	J	`jnl`	Balanced TSP partitioning. CoRR Benjamin Aram Berendsohn, Hwi Kim, László Kozma
2025	J	`jnl`	Compact representations of pattern-avoiding permutations. CoRR László Kozma, Michal Opler
2025	A	`conf`	Faster Exponential Algorithms for Cut Problems via Geometric Data Structures. ESA László Kozma, Junqi Tan
2025	J	`jnl`	Faster exponential algorithms for cut problems via geometric data structures. CoRR László Kozma, Junqi Tan
2024	A	`conf`	An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	J	`jnl`	An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	—	`conf`	Finding the saddlepoint faster than sorting. SOSA Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	J	`jnl`	Non-adaptive Bellman-Ford: Yen's improvement is optimal. CoRR Jialu Hu, László Kozma
2024	A	`conf`	Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma
2024	J	`jnl`	Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma
2024	A*	`conf`	Optimization with Pattern-Avoiding Input. STOC Benjamin Aram Berendsohn, László Kozma, Michal Opler
2024	J	`jnl`	Theoretical Analysis of Byte-Pair Encoding. CoRR László Kozma, Johannes Voderholzer
2023	A*	`conf`	Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
2023	J	`jnl`	Finding the saddlepoint faster than sorting. CoRR Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2023	J	`jnl`	Optimization with pattern-avoiding input. CoRR Benjamin Aram Berendsohn, László Kozma, Michal Opler
2023	J	`jnl`	Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
2022	J	`jnl`	Fast approximation of search trees on trees with centroid trees. CoRR Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
2022	B	`conf`	Fixed-Point Cycles and Approximate EFX Allocations. MFCS Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
2022	J	`jnl`	Fixed-point cycles and EFX allocations. CoRR Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
2022	B	`conf`	Group Testing with Geometric Ranges. ISIT Benjamin Aram Berendsohn, László Kozma
2022	A*	`conf`	Splay trees on trees. SODA Benjamin Aram Berendsohn, László Kozma
2022	—	`conf`	The Two-Squirrel Problem and Its Relatives. JCDCGGG Sergey Bereg, Yuya Higashikawa, Naoki Katoh, László Kozma, Manuel Lafond, Günter Rote, Yuki Tokuni, Max Willert, Binhai Zhu
2021	A*	`conf`	Analysis of Smooth Heaps and Slim Heaps. ICALP Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
2021	J	`jnl`	Analysis of Smooth Heaps and Slim Heaps. CoRR Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
2021	J	`jnl`	Finding and Counting Permutations via CSPs. Algorithmica Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2020	—	`conf`	Exact Exponential Algorithms for Two Poset Problems. SWAT László Kozma
2020	J	`jnl`	Geometric group testing. CoRR Benjamin Aram Berendsohn, László Kozma
2020	J	`jnl`	Smooth Heaps and a Dual View of Self-Adjusting Data Structures. SIAM J. Comput. László Kozma, Thatchaphol Saranurak
2020	J	`jnl`	Splay trees on trees. CoRR Benjamin Aram Berendsohn, László Kozma
2020	J	`jnl`	Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms André Berger, László Kozma, Matthias Mnich, Roland Vincze
2019	A*	`conf`	A time- and space-optimal algorithm for the many-visits TSP. SODA André Berger, László Kozma, Matthias Mnich, Roland Vincze
2019	J	`jnl`	Exact exponential algorithms for two poset problems. CoRR László Kozma
2019	J	`jnl`	Faster and simpler algorithms for finding large patterns in permutations. CoRR László Kozma
2019	B	`conf`	Finding and Counting Permutations via CSPs. IPEC Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2019	J	`jnl`	Finding and counting permutations via CSPs. CoRR Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2019	B	`conf`	Hamiltonicity Below Dirac's Condition. WG Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	J	`jnl`	Hamiltonicity below Dirac's condition. CoRR Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	—	`conf`	Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	A	`conf`	Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	J	`jnl`	Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	B	`conf`	Multi-Finger Binary Search Trees. ISAAC Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018	J	`jnl`	Multi-finger binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018	B	`conf`	Pairing heaps: the forward variant. MFCS Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2018	J	`jnl`	Review of Compact Data Structures - a practical approach by Gonzalo Navarro. SIGACT News László Kozma
2018	J	`jnl`	Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	A*	`conf`	Smooth heaps and a dual view of self-adjusting data structures. STOC László Kozma, Thatchaphol Saranurak
2018	J	`jnl`	Smooth heaps and a dual view of self-adjusting data structures. CoRR László Kozma, Thatchaphol Saranurak
2018	J	`jnl`	Time- and space-optimal algorithms for the many-visits TSP. CoRR André Berger, László Kozma, Matthias Mnich, Roland Vincze
2017	A*	`conf`	Maximum Scatter TSP in Doubling Metrics. SODA László Kozma, Tobias Mömke
2017	J	`jnl`	Pairing heaps: the forward variant. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2016	J	`jnl`	Binary search trees and rectangulations. CoRR László Kozma, Thatchaphol Saranurak
2016	—	`—`	Binary search trees, rectangles and patterns. László Kozma
2016	A	`conf`	Hitting Set for Hypergraphs of Low VC-dimension. ESA Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
2016	J	`jnl`	The landscape of bounds for binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	A Global Geometric View of Splaying. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	A PTAS for Euclidean Maximum Scatter TSP. CoRR László Kozma, Tobias Mömke
2015	B	`conf`	Greedy Is an Almost Optimal Deque. WADS Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Greedy Is an Almost Optimal Deque. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Hitting Set in hypergraphs of low VC-dimension. CoRR Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
2015	A*	`conf`	Pattern-Avoiding Access in Binary Search Trees. FOCS Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Pattern-avoiding access in binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	A	`conf`	Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2014	J	`jnl`	Review of the tower of Hanoi: myths and maths by Andreas M. Hinz, Sandi Klavžar, Urož Milutinović and Ciril Petr. SIGACT News László Kozma
2014	J	`jnl`	Streaming Algorithms for Partitioning Integer Sequences. CoRR Christian Konrad, László Kozma
2013	—	`conf`	Privacy by Fake Data: A Geometric Approach. CCCG Victor Alvarez, Erin W. Chambers, László Kozma
2013	J	`jnl`	Shattering, Graph Orientations, and Connectivity. Electron. J. Comb. László Kozma, Shay Moran
2012	A	`conf`	Minimum Average Distance Triangulations. ESA László Kozma
2012	J	`jnl`	Shattering, Graph Orientations, and Connectivity CoRR László Kozma, Shay Moran
2011	J	`jnl`	Minimum Average Distance Triangulations CoRR László Kozma
2009	B	`conf`	GaZIR: gaze-based zooming interface for image retrieval. ICMI László Kozma, Arto Klami, Samuel Kaski