On the dynamization of data structures

DOI10.1007/BF01934693zbMath0632.68025OpenAlexW2076407808MaRDI QIDQ1095647

S. Sitharama Iyengar, Vijay K. Vaishnavi, Nageswara S. V. Rao

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934693

zbMATH Keywords

Voronoi diagramsquadtreesamortized insertion and deletion costsK- d treesmerging costmerging of two data structuresmultiple attribute treesquery and storage costsupdate costs

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Efficient splitting and merging algorithms for order decomposable problems.

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the dynamization of data structures