A Tight Analysis of Slim Heaps and Smooth Heaps

08/10/2021
by   Corwin Sinnamon, et al.
0

The smooth heap and the closely related slim heap are recently invented self-adjusting implementations of the heap (priority queue) data structure. We analyze the efficiency of these data structures. We obtain the following amortized bounds on the time per operation: O(1) for make-heap, insert, find-min, and meld; O(loglog n) for decrease-key; and O(log n) for delete-min and delete, where n is the current number of items in the heap. These bounds are tight not only for smooth and slim heaps but for any heap implementation in Iacono and Özkan's pure heap model, intended to capture all possible "self-adjusting" heap implementations. Slim and smooth heaps are the first known data structures to match Iacono and Özkan's lower bounds and to satisfy the constraints of their model. Our analysis builds on Pettie's insights into the efficiency of pairing heaps, a classical self-adjusting heap implementation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2023

Efficiency of Self-Adjusting Heaps

Since the invention of the pairing heap by Fredman et al., it has been a...
research
07/10/2021

Analysis of Smooth Heaps and Slim Heaps

The smooth heap is a recently introduced self-adjusting heap [Kozma, Sar...
research
02/15/2018

Smooth heaps and a dual view of self-adjusting data structures

We present a new connection between self-adjusting binary search trees (...
research
11/26/2022

Lower Bounds on Retroactive Data Structures

We prove essentially optimal fine-grained lower bounds on the gap betwee...
research
05/15/2018

Parallel Working-Set Search Structures

In this paper we present two versions of a parallel working-set map on p...
research
06/19/2020

An Online Matching Model for Self-Adjusting ToR-to-ToR Networks

This is a short note that formally presents the matching model for the t...
research
09/04/2018

SOS lower bounds with hard constraints: think global, act local

Many previous Sum-of-Squares (SOS) lower bounds for CSPs had two deficie...

Please sign up or login with your details

Forgot password? Click here to reset