New Paths from Splay to Dynamic Optimality

07/15/2019
by   Caleb C. Levy, et al.
0

Consider the task of performing a sequence of searches in a binary search tree. After each search, an algorithm is allowed to arbitrarily restructure the tree, at a cost proportional to the amount of restructuring performed. The cost of an execution is the sum of the time spent searching and the time spent optimizing those searches with restructuring operations. This notion was introduced by Sleator and Tarjan in (JACM, 1985), along with an algorithm and a conjecture. The algorithm, Splay, is an elegant procedure for performing adjustments while moving searched items to the top of the tree. The conjecture, called "dynamic optimality," is that the cost of splaying is always within a constant factor of the optimal algorithm for performing searches. The conjecture stands to this day. In this work, we attempt to lay the foundations for a proof of the dynamic optimality conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2023

New Eliahou Semigroups and Verification of the Wilf Conjecture for Genus up to 65

We give a graphical reinterpretation of the seeds algorithm to explore t...
research
12/05/2019

Settling the relationship between Wilber's bounds for dynamic optimality

In FOCS 1986, Wilber proposed two combinatorial lower bounds on the oper...
research
01/08/2023

Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm

Binary search trees (BSTs) are one of the most basic and widely used dat...
research
07/15/2019

Splaying Preorders and Postorders

Let T be a binary search tree. We prove two results about the behavior o...
research
10/23/2018

Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3

Gadget3 is nowadays one of the most frequently used high performing para...
research
10/26/2021

Efficient solvers for Armijo's backtracking problem

Backtracking is an inexact line search procedure that selects the first ...
research
06/18/2018

Zip Trees

We introduce the zip tree, a form of randomized binary search tree. One ...

Please sign up or login with your details

Forgot password? Click here to reset