Pages that link to "Item:Q1152223"
From MaRDI portal
The following pages link to Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223):
Displayed 25 items.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Two-tier relaxed heaps (Q929299) (← links)
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038) (← links)
- A balanced search tree O(1) worst-case update time (Q1114387) (← links)
- On the equivalence of some rectangle problems (Q1165008) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Improved bounds for finger search on a RAM (Q1950391) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Computing rectangle enclosures (Q2365809) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- Maintaining discrete probability distributions optimally (Q4630265) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- (Q5116523) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines (Q6180227) (← links)