László Kozma
László Kozma
Freie Universität Berlin, Department of Mathematics and Computer Science
Verified email at cs.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
GaZIR: Gaze-based zooming interface for image retrieval
L Kozma, A Klami, S Kaski
Proceedings of the 2009 international conference on Multimodal interfaces …, 2009
602009
k Nearest Neighbors algorithm (kNN)
L Kozma
Helsinki University of Technology, 2008
54*2008
Binary principal component analysis in the Netflix collaborative filtering task
L Kozma, A Ilin, T Raiko
2009 IEEE International Workshop on Machine Learning for Signal Processing, 1-6, 2009
292009
Pattern-avoiding access in binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015
232015
Selection from heaps, row-sorted matrices and using soft heaps
H Kaplan, L Kozma, O Zamir, U Zwick
arXiv preprint arXiv:1802.07041, 2018
212018
Shattering, graph orientations, and connectivity
L Kozma, S Moran
arXiv preprint arXiv:1211.1319, 2012
162012
Hitting set for hypergraphs of low VC-dimension
K Bringmann, L Kozma, S Moran, NS Narayanaswamy
arXiv preprint arXiv:1512.00481, 2015
142015
Finding and counting permutations via CSPs
BA Berendsohn, L Kozma, D Marx
Algorithmica, 1-26, 2021
13*2021
Time-and space-optimal algorithm for the many-visits TSP
A Berger, L Kozma, M Mnich, R Vincze
ACM Transactions on Algorithms (TALG) 16 (3), 1-22, 2020
132020
Self-adjusting binary search trees: What makes them tick?
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms-ESA 2015, 300-312, 2015
12*2015
Multi-finger binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1809.01759, 2018
11*2018
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
102017
Smooth heaps and a dual view of self-adjusting data structures
L Kozma, T Saranurak
SIAM Journal on Computing 49 (5), STOC18-45-STOC18-93, 2019
92019
Binary search trees, rectangles and patterns
L Kozma
72016
Greedy is an almost optimal deque
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Workshop on Algorithms and Data Structures, 152-165, 2015
52015
Improved bounds for multipass pairing heaps and path-balanced binary search trees
D Dorfman, H Kaplan, L Kozma, S Pettie, U Zwick
arXiv preprint arXiv:1806.08692, 2018
32018
Minimum average distance triangulations
L Kozma
European Symposium on Algorithms, 695-706, 2012
32012
Splay trees on trees
BA Berendsohn, L Kozma
arXiv preprint arXiv:2010.00931, 2020
22020
Hamiltonicity below Dirac’s condition
BMP Jansen, L Kozma, J Nederlof
International Workshop on Graph-Theoretic Concepts in Computer Science, 27-39, 2019
22019
Analysis of smooth heaps and slim heaps
M Hartmann, L Kozma, C Sinnamon, RE Tarjan
arXiv preprint arXiv:2107.04919, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20