Maintaining multiple representations of dynamic data structures

DOI10.1016/0890-5401(89)90058-8MaRDI QIDQ582046zbMATH OpenOpenAlexFDO

Authors Michiel Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas

Publication date 1989

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(89)90058-8

zbMATH Keywords

client structuremultiple representation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Theory of operating systems (68N25)

Recommendations

• On the dynamization of data structures
• A compact data structure for representing a dynamic multiset
• Concurrent Maintenance of Data Structures in a Distributed Environment
• Dynamic deferred data structuring
• scientific article; zbMATH DE number 4113964

Cites work

• scientific article; zbMATH DE number 4051018 (Why is no real title available?)
• scientific article; zbMATH DE number 3770965 (Why is no real title available?)
• scientific article; zbMATH DE number 4113964 (Why is no real title available?)
• Adding range restriction capability to dynamic data structures
• Binary Search Trees of Bounded Balance
• Convex hulls of finite sets of points in two and three dimensions
• Decomposable searching problems
• Decomposable searching problems I. Static-to-dynamic transformation
• Maintaining range trees in secondary memory. Part I: Partitions
• On the average number of rebalancing operations in weight-balanced trees
• Optimal Search in Planar Subdivisions
• The design of dynamic data structures
• Updating a balanced search tree in 0(1) rotations

Cited in

(2)

• Multiple data structuring
• scientific article; zbMATH DE number 4113964 (Why is no real title available?)

This page was built for publication: Maintaining multiple representations of dynamic data structures

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