Fully persistent arrays. (Extended abstract)

DOI10.1007/3-540-51542-9_8MaRDI QIDQ4028876zbMATH OpenFDO

Authors Paul F. Dietz

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_8

zbMATH Keywords

arraysfully persistent

Mathematics Subject Classification ID

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

Recommendations

• Making data structures confluently persistent. (Extended abstract)
• Making data structures confluently persistent
• scientific article; zbMATH DE number 1897131
• Making data structures persistent
• Fully persistent B-trees
• Fully persistent B-trees
• Semi-persistent Data Structures

Cited in

(22)

• Using time stamps for storing and addressing extendible arrays
• Making data structures persistent
• A space efficient variant of path copying for partially persistent sorted sets
• Two-dimensional packet classification and filter conflict resolution in the internet
• scientific article; zbMATH DE number 2185599 (Why is no real title available?)
• Confluently Persistent Tries for Efficient Version Control
• Some Results for Elementary Operations
• A new method for functional arrays
• scientific article; zbMATH DE number 4115931 (Why is no real title available?)
• Simple confluently persistent catenable lists
• Lower bounds for monotonic list labeling
• Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
• The online house numbering problem: min-max online list labeling
• Dynamic planar orthogonal point location in sublogarithmic time
• On-the-fly array initialization in less space
• Confluent persistence revisited
• Random access in persistent strings and segment selection
• Fast algorithms via dynamic-oracle matroids
• Almost optimal exact distance oracles for planar graphs
• Compressed dictionary matching on run-length encoded strings
• Compressed dictionary matching on run-length encoded strings
• Confluently persistent tries for efficient version control

This page was built for publication: Fully persistent arrays. (Extended abstract)

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