Simple Confluently Persistent Catenable Lists

DOI10.1137/S0097539798339430MaRDI QIDQ4507379zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Chris Okasaki, Robert E. Tarjan

Publication date 18 October 2000

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

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

zbMATH Keywords

data structuresdouble-ended queue (deque)functional programmingmemoizationpersistent data structuresqueuestackstack-ended queue (steque)

Mathematics Subject Classification ID

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

Recommendations

• Simple confluently persistent catenable lists
• Catenable double-ended queues
• scientific article; zbMATH DE number 1263185
• Making data structures persistent
• scientific article; zbMATH DE number 1256736

Cited in

(8)

• Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
• scientific article; zbMATH DE number 1256736 (Why is no real title available?)
• scientific article; zbMATH DE number 1263185 (Why is no real title available?)
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Numerical representations as purely functional data structures
• Simple confluently persistent catenable lists
• A representation for linear lists with movable fingers
• Lists revisited, cache-conscious STL lists

This page was built for publication: Simple Confluently Persistent Catenable Lists

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