Skip to content

Author

László Kozma

We have 2 of 8 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Exact algorithms for optimal discretization

An algorithm for optimal discretization that runs in time $2^n$ and the related point separation problem that asks to separate all input points by axis-parallel lines is studied, with guarantees that hold even if points are allowed to share coordinates.

László Kozma, Junqiang Tan · 0 citations
Conference 2026

Learning-Augmented Online Sorting and TSP

It is shown that predictions enable an algorithm that is simultaneously O (1)-consistent and O (log n )-robust for online sorting with predictions, and this result is extended to the setting of multiple predictions.

I. Bercea, G. Brodal, John Iacono et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.