4 citations · 7 across the 5 of their papers we have counts for
7 papers · 1 filter
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…