Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues

DOI10.1137/S0097539792242144zbMath0845.68024OpenAlexW2133337074MaRDI QIDQ4862793

Rajamani Sundar, Adam L. Buchsbaum, Robert Endre Tarjan

Publication date: 15 September 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792242144

zbMATH Keywords

data-structural bootstrappingdeque with heap order

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (2)

Simple confluently persistent catenable lists ⋮ Optimal purely functional priority queues

This page was built for publication: Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues