Confluently Persistent Deques via Data-Structural Bootstrapping

DOI10.1006/JAGM.1995.1020zbMATH Open0834.68012OpenAlexW4240404419MaRDI QIDQ4837545FDOQ4837545

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

Recommendations

• scientific article
• 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

zbMATH Keywords

data structuresdata-structural bootstrapping

Mathematics Subject Classification ID

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

Cited In (8)

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

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)