scientific article; zbMATH DE number 140460

zbMATH Open0767.68017MaRDI QIDQ4028876FDOQ4028876

Authors: Paul F. Dietz 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

arraysfully persistent

Mathematics Subject Classification ID

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

Cited In (17)

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

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)