scientific article; zbMATH DE number 140460

MaRDI QIDQ4028876zbMATHFDO

Authors Paul F. Dietz

Publication date 28 March 1993

zbMATH Keywords

arraysfully persistent

Mathematics Subject Classification ID

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

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

(18)

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

This page was built for publication:

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