Confluently Persistent Deques via Data-Structural Bootstrapping

DOI10.1006/JAGM.1995.1020MaRDI QIDQ4837545zbMATHOpenAlexFDO

Authors Adam L. Buchsbaum, Robert E. Tarjan

Publication date 18 March 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1995.1020

zbMATH Keywords

data structuresdata-structural bootstrapping

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 437540
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
• scientific article; zbMATH DE number 1263185
• Simple Confluently Persistent Catenable Lists
• Simple confluently persistent catenable lists

Cited in

(8)

• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• Optimal purely functional priority queues
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
• Making data structures confluently persistent
• Inductive benchmarking for purely functional data structures
• Space-efficient functional offline-partially-persistent trees with applications to planar point location
• Theory and practice of chunked sequences
• Simple confluently persistent catenable lists

This page was built for publication: Confluently Persistent Deques via Data-Structural Bootstrapping

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