The following pages link to (Q4633824):
Displayed 28 items.
- Affine invariants of generalized polygons and matching under affine transformations (Q340532) (← links)
- Optimal partition trees (Q420575) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q540448) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Range queries on uncertain data (Q897858) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Fault-tolerant spanners in networks with symmetric directional antennas (Q1680529) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Range search on tuples of points (Q2253898) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- (Q5088951) (← links)
- (Q5111686) (← links)
- Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces (Q5136243) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q5136267) (← links)
- Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces (Q5234039) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Reachability problems for transmission graphs (Q5896888) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- Reachability problems for transmission graphs (Q5918537) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)