Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarLá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
- László Kozma 0001 — Enterprise for Computer Applications, Budapest, Hungary
- László Kozma 0003 — Eötvös Loránt University, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 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@SODA 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 - [i19]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity below Dirac's condition. CoRR abs/1902.01745 (2019) - [i18]László Kozma:
Faster and simpler algorithms for finding large patterns in permutations. CoRR abs/1902.08809 (2019) - [i17]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and counting permutations via CSPs. CoRR abs/1908.04673 (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. Electr. J. Comb. 20(3): P44 (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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-12-06 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
