default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Kozma 0002
Person information
- affiliation: Freie Universität Berlin, Germany
- affiliation: Saarland University, Department of Computer Science
- affiliation: Helsinki University of Technology, Department of Information and Computer Science
Other persons with the same name
- László Kozma 0001 — Enterprise for Computer Applications, Budapest, Hungary
- László Kozma 0003 — Eötvös Loránt University, Budapest, Hungary
Other persons with a similar name
- Laszlo Kozma-Bognar — University of Edinburgh, School of Biological Sciences
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA 2024: 5:1-5:15- [c25]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA 2024: 44:1-44:12 - [c24]Justin Dallant, Frederik Haagensen
, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. SOSA 2024: 168-178 - [c23]Benjamin Aram Berendsohn, László Kozma, Michal Opler:
Optimization with Pattern-Avoiding Input. STOC 2024: 671-682 - [i31]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR abs/2401.06512 (2024) - [i30]Jialu Hu, László Kozma:
Non-adaptive Bellman-Ford: Yen's improvement is optimal. CoRR abs/2402.10343 (2024) - [i29]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR abs/2406.19257 (2024) - 2023
- [c22]Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma:
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP 2023: 19:1-19:20 - [i28]Benjamin Aram Berendsohn, László Kozma, Michal Opler:
Optimization with pattern-avoiding input. CoRR abs/2310.04236 (2023) - [i27]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. CoRR abs/2310.16801 (2023) - [i26]Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant:
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13(5): 114-135 (2023) - 2022
- [c21]Benjamin Aram Berendsohn, László Kozma:
Group Testing with Geometric Ranges. ISIT 2022: 868-873 - [c20]Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma:
Fixed-Point Cycles and Approximate EFX Allocations. MFCS 2022: 17:1-17:13 - [c19]Benjamin Aram Berendsohn, László Kozma:
Splay trees on trees. SODA 2022: 1875-1900 - [i25]Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma:
Fixed-point cycles and EFX allocations. CoRR abs/2201.08753 (2022) - [i24]Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma:
Fast approximation of search trees on trees with centroid trees. CoRR abs/2209.08024 (2022) - 2021
- [j6]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and Counting Permutations via CSPs. Algorithmica 83(8): 2552-2577 (2021) - [c18]Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan:
Analysis of Smooth Heaps and Slim Heaps. ICALP 2021: 79:1-79:20 - [i23]Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan:
Analysis of Smooth Heaps and Slim Heaps. CoRR abs/2107.04919 (2021) - 2020
- [j5]László Kozma, Thatchaphol Saranurak:
Smooth Heaps and a Dual View of Self-Adjusting Data Structures. SIAM J. Comput. 49(5) (2020) - [j4]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16(3): 35:1-35:22 (2020) - [c17]László Kozma:
Exact Exponential Algorithms for Two Poset Problems. SWAT 2020: 30:1-30:15 - [i22]Benjamin Aram Berendsohn, László Kozma:
Geometric group testing. CoRR abs/2004.14632 (2020) - [i21]Benjamin Aram Berendsohn, László Kozma:
Splay trees on trees. CoRR abs/2010.00931 (2020)
2010 – 2019
- 2019
- [c16]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and Counting Permutations via CSPs. IPEC 2019: 1:1-1:16 - [c15]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA 2019: 5:1-5:21 - [c14]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
A time- and space-optimal algorithm for the many-visits TSP. SODA 2019: 1770-1782 - [c13]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity Below Dirac's Condition. WG 2019: 27-39 - [i20]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity below Dirac's condition. CoRR abs/1902.01745 (2019) - [i19]László Kozma:
Faster and simpler algorithms for finding large patterns in permutations. CoRR abs/1902.08809 (2019) - [i18]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and counting permutations via CSPs. CoRR abs/1908.04673 (2019) - [i17]László Kozma:
Exact exponential algorithms for two poset problems. CoRR abs/1912.13117 (2019) - 2018
- [j3]László Kozma:
Review of Compact Data Structures - a practical approach by Gonzalo Navarro. SIGACT News 49(3): 9-13 (2018) - [c12]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: 24:1-24:13 - [c11]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. ISAAC 2018: 55:1-55:26 - [c10]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. MFCS 2018: 13:1-13:14 - [c9]László Kozma, Thatchaphol Saranurak:
Smooth heaps and a dual view of self-adjusting data structures. STOC 2018: 801-814 - [i16]László Kozma, Thatchaphol Saranurak:
Smooth heaps and a dual view of self-adjusting data structures. CoRR abs/1802.05471 (2018) - [i15]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR abs/1802.07041 (2018) - [i14]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and space-optimal algorithms for the many-visits TSP. CoRR abs/1804.06361 (2018) - [i13]Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR abs/1806.08692 (2018) - [i12]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-finger binary search trees. CoRR abs/1809.01759 (2018) - 2017
- [c8]László Kozma, Tobias Mömke:
Maximum Scatter TSP in Doubling Metrics. SODA 2017: 143-153 - [i11]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. CoRR abs/1709.01152 (2017) - 2016
- [b1]László Kozma:
Binary search trees, rectangles and patterns. Saarland University, Saarbrücken, Germany, 2016 - [c7]Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy:
Hitting Set for Hypergraphs of Low VC-dimension. ESA 2016: 23:1-23:18 - [i10]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016) - [i9]László Kozma, Thatchaphol Saranurak:
Binary search trees and rectangulations. CoRR abs/1603.08151 (2016) - 2015
- [c6]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312 - [c5]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - [c4]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. WADS 2015: 152-165 - [i8]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015) - [i7]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. CoRR abs/1506.08319 (2015) - [i6]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-avoiding access in binary search trees. CoRR abs/1507.06953 (2015) - [i5]Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy:
Hitting Set in hypergraphs of low VC-dimension. CoRR abs/1512.00481 (2015) - [i4]László Kozma, Tobias Mömke:
A PTAS for Euclidean Maximum Scatter TSP. CoRR abs/1512.02963 (2015) - 2014
- [j2]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): 34-36 (2014) - [i3]Christian Konrad, László Kozma:
Streaming Algorithms for Partitioning Integer Sequences. CoRR abs/1404.1732 (2014) - 2013
- [j1]László Kozma, Shay Moran:
Shattering, Graph Orientations, and Connectivity. Electron. J. Comb. 20(3): 44 (2013) - [c3]Victor Alvarez, Erin W. Chambers, László Kozma:
Privacy by Fake Data: A Geometric Approach. CCCG 2013 - 2012
- [c2]László Kozma:
Minimum Average Distance Triangulations. ESA 2012: 695-706 - [i2]László Kozma, Shay Moran:
Shattering, Graph Orientations, and Connectivity. CoRR abs/1211.1319 (2012) - 2011
- [i1]László Kozma:
Minimum Average Distance Triangulations. CoRR abs/1112.1828 (2011)
2000 – 2009
- 2009
- [c1]László Kozma, Arto Klami, Samuel Kaski:
GaZIR: gaze-based zooming interface for image retrieval. ICMI 2009: 305-312
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
