Maintaining range trees in secondary memory. Part I: Partitions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (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
- Decomposable searching problems
- Implementation of the grid file: Design concepts and experience
- On the average number of rebalancing operations in weight-balanced trees
- Organization and maintenance of large ordered indexes
- The design of dynamic data structures
Cited in
(9)- scientific article; zbMATH DE number 1947388 (Why is no real title available?)
- Maintaining multiple representations of dynamic data structures
- Topology B-trees and their applications
- scientific article; zbMATH DE number 4051018 (Why is no real title available?)
- New Data Structures for Orthogonal Range Queries
- Maintaining range trees is secondary memory. Part II: Lower bounds
- scientific article; zbMATH DE number 910894 (Why is no real title available?)
- scientific article; zbMATH DE number 140471 (Why is no real title available?)
- scientific article; zbMATH DE number 4060691 (Why is no real title available?)
This page was built for publication: Maintaining range trees in secondary memory. Part I: Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120266)