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

DOI10.1137/S0097539792242144MaRDI QIDQ4862793zbMATH OpenOpenAlexFDO

Authors Adam L. Buchsbaum, Rajamani Sundar, Robert E. 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)

Recommendations

• scientific article; zbMATH DE number 1256639
• scientific article; zbMATH DE number 437540
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Correspondence-based data structures for double-ended priority queues
• scientific article; zbMATH DE number 1003250
• A general framework for dynamic succinct and compressed data structures
• Smooth heaps and a dual view of self-adjusting data structures
• Smooth heaps and a dual view of self-adjusting data structures
• Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
• Catenable double-ended queues

Cited in

(7)

• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• Purely functional, real-time deques with catenation
• Simple confluently persistent catenable lists
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Stacks, queues, and deques with order-statistic operations
• Optimal purely functional priority queues
• scientific article; zbMATH DE number 1857505 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862793)