Cited in
(96)- On the complexity of closest pair via polar-pair of point-sets
- On the complexity of closest pair via polar-pair of point-sets
- A data structure for dynamic range queries
- A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes
- MEPDF
- Noisy colored point set matching
- Orthogonal range searching in linear and almost-linear space
- Linear space data structures for two types of range search
- The average performance analysis of a closest‐pair algorithm
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Computing on a free tree via complexity-preserving mappings
- Fast multivariate empirical cumulative distribution function with connection to kernel density estimation
- In-place algorithms for computing (Layers of) maxima
- Optimal external memory planar point enclosure
- Fractional cascading. II: Applications
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- A fast algorithm for computing sample entropy
- Multivariate analysis of orthogonal range searching and graph distances
- Simplex Range Searching and Its Variants: A Review
- Integrating Pareto optimization into dynamic programming
- A disk-aware algorithm for time series motif discovery
- Semi-local longest common subsequences in subquadratic time
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
- Faster output-sensitive skyline computation algorithm
- Light orthogonal networks with constant geometric dilation
- Approximate colored range and point enclosure queries
- Dynamic orthogonal range queries in OLAP.
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- Ordered theta graphs
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Permutation inversions and multidimensional cumulative distribution functions
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Dynamic range majority data structures
- Efficient splitting and merging algorithms for order decomposable problems.
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- On the average length of Delaunay triangulations
- Stabilized branch-and-price algorithms for vector packing problems
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- Space and time optimal algorithms for a class of rectangle intersection problems
- Faster subsequence recognition in compressed strings
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Polygonal intersection searching
- On the angle restricted nearest neighbor problem
- A parallel algorithm to solve the stable marriage problem
- On the definition and computation of rectilinear convex hulls
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
- Using persistent data structures for adding range restrictions to searching problems
- Multivariate analysis of orthogonal range searching and graph distances
- An algorithm for handling many relational calculus queries efficiently.
- Robust Monte Carlo localization for mobile robots
- An application of $m$-ary trees to the design of data structures for geometric searching problems
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- On the parallel-decomposability of geometric problems
- On the equivalence of some rectangle problems
- Accounting for factor variables in big data regression
- A New Lower Bound for Semigroup Orthogonal Range Searching
- A condition for the identification of multivariate models with binary instruments
- A deterministic skip list for \(k\)-dimensional range search
- Structure and algorithms of SL-AV atmosphere model parallel program complex
- An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- K-Dominance in Multidimensional Data: Theory and Applications
- Internal dictionary matching
- Biased range trees
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure
- Average stretch factor: how low does it go?
- Robust weighted Gaussian processes
- A general framework for efficient clustering of large datasets based on activity detection
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Improved quick hypervolume algorithm
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- A new coding-based algorithm for finding closest pair of vectors
- Boundary estimation from point clouds: algorithms, guarantees and applications
- An Improved Vectorization Algorithm to Solve the d-MP Problem
- Dynamic and internal longest common substring
- MEPDF: Multivariate empirical density functions
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Extending range queries and nearest neighbors
- Efficient range searching for categorical and plain data
- K-dominance in multidimensional data: theory and applications
- A Monte Carlo strategy for data-based mathematical modeling
- Dominance in the presence of obstacles
- Dominance product and high-dimensional closest pair under \(L_\infty\)
- Space Efficient Multi-dimensional Range Reporting
- scientific article; zbMATH DE number 7370628 (Why is no real title available?)
- Interval finding and its application to data mining
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
- Learning Binary Hash Codes for Large-Scale Image Search
- Gathering in the plane of location-aware robots in the presence of spies
- External memory orthogonal range reporting with fast updates
This page was built for publication: Multidimensional divide-and-conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q148390)
