5 papers
Exact algorithms for optimal discretization
László Kozma, Junqi Tan
The optimal discretization problem asks, given two disjoint sets of points and in the plane, for a minimal family of horizontal and vertical lines that separate the two set…
Fast and simple multiplication of bounded twin-width matrices
László Kozma, Michal Opler
Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorit…
Faster exponential algorithms for cut problems via geometric data structures
László Kozma, Junqi Tan
For many hard computational problems, simple algorithms that run in time arise, say, from enumerating all subsets of a size- set. Finding (exponentially) fa…
Theoretical Analysis of Byte-Pair Encoding
László Kozma, Johannes Voderholzer
Byte-Pair Encoding (BPE) is a widely used method for subword tokenization, with origins in grammar-based text compression. It is employed in a variety of language processing tasks…
Online sorting and online TSP: randomized, stochastic, and high-dimensional
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta +2
In the online sorting problem, items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size- array. The goal is to minimize t…