Confluently Persistent Deques via Data-Structural Bootstrapping

DOI10.1006/JAGM.1995.1020MaRDI QIDQ4837545zbMATH OpenOpenAlexFDO

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

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

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

(9)

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

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)