4 citations · 13 across the 20 of their papers we have counts for
30 papers
On the Existence of Parallel one Forms
Laszlo Kozma, Salah Gomaa Elgendi
In this paper, using the Finslerian settings, we study the existence of parallel one forms (or, equivalently parallel vector fields) on a Riemannian manifold. We show that a parall…
Hopf-Rinow Theorem of sub-Finslerian geometry
Layth M. Alabdulsada, Laszlo Kozma
The sub-Finslerian geometry means that the metric is defined only on a given subbundle of the tangent bundle, called a horizontal bundle. In the paper, a version of the Hopf-Ri…
Fast approximation of search trees on trees with centroid trees
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan +1
Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a p…
Fixed-point cycles and EFX allocations
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
We study edge-labelings of the complete bidirected graph with functions from the set to itself. We call a cycle in $\o…
Analysis of Smooth Heaps and Slim Heaps
Maria Hartmann, László Kozma, Corwin Sinnamon +1
The smooth heap is a recently introduced self-adjusting heap [Kozma, Saranurak, 2018] similar to the pairing heap [Fredman, Sedgewick, Sleator, Tarjan, 1986]. The smooth heap was o…
Splay trees on trees
Benjamin Aram Berendsohn, László Kozma
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special c…
Geometric group testing
Benjamin Aram Berendsohn, László Kozma
Group testing is concerned with identifying defective items in a set of items, where each test reports whether a specific subset of items contains at least one defective. I…
Exact exponential algorithms for two poset problems
László Kozma
Partially ordered sets (posets) are fundamental combinatorial objects with important applications in computer science. Perhaps the most natural algorithmic task, given a size- p…
Finding and counting permutations via CSPs
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1…
Hamiltonicity below Dirac's condition
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Dirac's theorem (1952) is a classical result of graph theory, stating that an -vertex graph () is Hamiltonian if every vertex has degree at least . Both the value…
Faster and simpler algorithms for finding large patterns in permutations
László Kozma
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1…
Multi-finger binary search trees
Parinya Chalermsook, Mayank Goswami, László Kozma +2
We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the well-studied -server problem. Finger search is a p…
Improved bounds for multipass pairing heaps and path-balanced binary search trees
Dani Dorfman, Haim Kaplan, László Kozma +2
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient…
-metrics satisfying the -Condition or the -Condition
S. G. Elgendi, Laszlo Kozma
We describe the -metrics whose the -tensor vanishes (-condition) and the -metrics that satisfy the -condition , where $σ_h=\frac{\partial σ}…
A time- and space-optimal algorithm for the many-visits TSP
André Berger, László Kozma, Matthias Mnich +1
The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of cities that visits each city a prescribed number of times. Travel costs may be asym…
On non-positive curvature properties of the Hilbert metric
Layth M. Alabdulsada, László Kozma
In this paper, we consider different types of non-positive curvature properties of the Hilbert metric of a convex domain in R^n. First, we survey the relationships among the concep…
Selection from heaps, row-sorted matrices and using soft heaps
Haim Kaplan, László Kozma, Or Zamir +1
We use soft heaps to obtain simpler optimal algorithms for selecting the -th smallest item, and the set of~ smallest items, from a heap-ordered tree, from a collection of sor…
Smooth heaps and a dual view of self-adjusting data structures
László Kozma, Thatchaphol Saranurak
We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures.…
Pairing heaps: the forward variant
Dani Dorfman, Haim Kaplan, László Kozma +1
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent pe…
Binary search trees and rectangulations
László Kozma, Thatchaphol Saranurak
We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatoria…
The landscape of bounds for binary search trees
Parinya Chalermsook, Mayank Goswami, László Kozma +2
Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) w…
Maximum Scatter TSP in Doubling Metrics
László Kozma, Tobias Mömke
We study the problem of finding a tour of points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length…
Hitting Set for hypergraphs of low VC-dimension
Karl Bringmann, László Kozma, Shay Moran +1
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized co…
Pattern-avoiding access in binary search trees
Parinya Chalermsook, Mayank Goswami, Laszlo Kozma +2
The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST…