Pages that link to "Item:Q3911409"
From MaRDI portal
The following pages link to Decomposable searching problems I. Static-to-dynamic transformation (Q3911409):
Displaying 50 items.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- Optimal partition trees (Q420575) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Dynamic coresets (Q834605) (← links)
- Greedy matching on a grid (Q921922) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- Fractional cascading. I: A data structuring technique (Q1099957) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← links)
- Making data structures persistent (Q1117690) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- A note on Euclidean near neighbor searching in the plane (Q1253102) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
