Παρακολούθηση
László Kozma
László Kozma
Freie Universität Berlin, Department of Mathematics and Computer Science
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cs.uni-saarland.de - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
k Nearest Neighbors algorithm overview (kNN)
L Kozma
Helsinki University of Technology 32, 2008
782008
GaZIR: Gaze-based zooming interface for image retrieval
L Kozma, A Klami, S Kaski
Proceedings of the 2009 international conference on Multimodal interfaces …, 2009
652009
Useful Inequalities Cheat Sheet
L Kozma
lkozma.net/inequalities_cheat_sheet/, 2016
43*2016
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
352015
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
352009
Hitting set for hypergraphs of low VC-dimension
K Bringmann, L Kozma, S Moran, NS Narayanaswamy
arXiv preprint arXiv:1512.00481, 2015
252015
Selection from heaps, row-sorted matrices and using soft heaps
H Kaplan, L Kozma, O Zamir, U Zwick
arXiv preprint arXiv:1802.07041, 2018
242018
Smooth heaps and a dual view of self-adjusting data structures
L Kozma, T Saranurak
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
222018
Finding and counting permutations via CSPs
BA Berendsohn, L Kozma, D Marx
Algorithmica 83, 2552-2577, 2021
21*2021
Multi-finger binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1809.01759, 2018
20*2018
Shattering, graph orientations, and connectivity
L Kozma, S Moran
arXiv preprint arXiv:1211.1319, 2012
202012
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
182020
Fixed-point cycles and approximate EFX allocations
BA Berendsohn, S Boyadzhiyska, L Kozma
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
17*2022
Splay trees on trees
BA Berendsohn, L Kozma
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
152022
Hamiltonicity below Dirac’s condition
BMP Jansen, L Kozma, J Nederlof
International Workshop on Graph-Theoretic Concepts in Computer Science, 27-39, 2019
152019
Self-adjusting binary search trees: What makes them tick?
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
15*2015
Greedy is an almost optimal deque
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
152015
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
14*2017
Binary search trees, rectangles and patterns
L Kozma
92016
Analysis of smooth heaps and slim heaps
M Hartmann, L Kozma, C Sinnamon, RE Tarjan
arXiv preprint arXiv:2107.04919, 2021
52021
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20