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

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 801-814, 2018.

Cited by: 3|Bibtex|Views11|DOI:https://doi.org/10.1145/3188745.3188864
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

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 (Allen,Munro, 1978; Sleator, Tarjan, 1983; Fredman, Sedgewick, Sleator, Tarjan, 1986; Wilber, 1989; Fredman, 1999; Iacono, Özkan, 2014). Roughly speaking, we ma...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments