The following pages link to Multidimensional divide-and-conquer (Q148390):
Displaying 50 items.
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- Faster output-sensitive skyline computation algorithm (Q402378) (← links)
- A disk-aware algorithm for time series motif discovery (Q408596) (← links)
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Ordered theta graphs (Q598550) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- A parallel algorithm to solve the stable marriage problem (Q798000) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Space and time optimal algorithms for a class of rectangle intersection problems (Q1148121) (← links)
- Permutation inversions and multidimensional cumulative distribution functions (Q1163866) (← links)
- Polygonal intersection searching (Q1165007) (← links)
- On the equivalence of some rectangle problems (Q1165008) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- MEPDF (Q1352125) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- Improved quick hypervolume algorithm (Q1652507) (← links)
- Structure and algorithms of SL-AV atmosphere model parallel program complex (Q1662790) (← links)
- Integrating Pareto optimization into dynamic programming (Q1736764) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- A data structure for dynamic range queries (Q1838844) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- A Monte Carlo strategy for data-based mathematical modeling (Q1903397) (← links)
