Maintaining multiple representations of dynamic data structures

DOI10.1016/0890-5401(89)90058-8zbMath0689.68019OpenAlexW1999037897MaRDI QIDQ582046

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Maintaining range trees in secondary memory. Part I: Partitions
• On the average number of rebalancing operations in weight-balanced trees
• Decomposable searching problems
• Updating a balanced search tree in 0(1) rotations
• Adding range restriction capability to dynamic data structures
• Decomposable searching problems I. Static-to-dynamic transformation
• Optimal Search in Planar Subdivisions
• Convex hulls of finite sets of points in two and three dimensions
• Binary Search Trees of Bounded Balance

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