The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A near optimal data structure for a type of range query problem
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Divide and conquer algorithms for closest point problems in multidimensional space.
Divide and conquer algorithms for closest point problems in multidimensional space.
Computational geometry.
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Linear data structures for two types of range search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Deferred data structuring: Query-driven preprocessing for geometric search problems
SCG '86 Proceedings of the second annual symposium on Computational geometry
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
An algorithm for multidimensional data clustering
ACM Transactions on Mathematical Software (TOMS)
Using induction to design algorithms
Communications of the ACM
Computational geometry on hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Mesh Computer Algorithms for Computational Geometry
IEEE Transactions on Computers
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the parallel decomposability of geometric problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Parallel algorithms for geometric searching problems
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Computing geographic nearest neighbors using monotone matrix searching (preliminary version)
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
A compendium of key search references
ACM SIGIR Forum
High level support for divide-and-conquer parallelism
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dominance range-query: the one-reporting case
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
OODB indexing by class-division
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Do we teach the right algorithm design techniques?
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Colearning in Differential Games
Machine Learning
Accelerating exact k-means algorithms with geometric reasoning
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multikey retrieval from K-d trees and QUAD-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
New techniques for some dynamic closest-point and farthest-point problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Fast software for box intersections
Proceedings of the sixteenth annual symposium on Computational geometry
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finite-resolution hidden surface removal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Improving min/max aggregation over spatial objects
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Massively Parallel Algorithms for Trace-Driven Cache Simulations
IEEE Transactions on Parallel and Distributed Systems
Temporal and spatio-temporal aggregations over data streams using multiple time granularities
Information Systems - Special issue: Best papers from EDBT 2002
Temporal Aggregation over Data Streams Using Multiple Granularities
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Hierarchical Compact Cube for Range-Max Queries
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Parallel Algorithms for Grounded Range Search and Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Range-Max/Min Query in OLAP Data Cube
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
ACM SIGACT News
Spatiotemporal Aggregate Computation: A Survey
IEEE Transactions on Knowledge and Data Engineering
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable ranking for preference queries
Proceedings of the 14th ACM international conference on Information and knowledge management
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
A calculator for Pareto points
Proceedings of the conference on Design, automation and test in Europe
IEEE Transactions on Computers
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Approximate colored range and point enclosure queries
Journal of Discrete Algorithms
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
Engineering the divide-and-conquer closest pair algorithm
Journal of Computer Science and Technology
Space Efficient Multi-dimensional Range Reporting
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Thread-based implementations of the false nearest neighbors method
Parallel Computing
Adapting indexing trees to data distribution in feature spaces
Computer Vision and Image Understanding
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
The Journal of Machine Learning Research
Parallel processing of data from very large-scale wireless sensor networks
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Algorithms and theory of computation handbook
A disk-aware algorithm for time series motif discovery
Data Mining and Knowledge Discovery
Noisy colored point set matching
Discrete Applied Mathematics
Asymptotically efficient algorithms for skyline probabilities of uncertain data
ACM Transactions on Database Systems (TODS)
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Space efficient data structures for dynamic orthogonal range counting
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Efficient traffic crash and snow complaint GIS system
Proceedings of the 12th Annual International Digital Government Research Conference: Digital Government Innovation in Challenging Times
Maxima-finding algorithms for multidimensional samples: A two-phase approach
Computational Geometry: Theory and Applications
New algorithms for example-based super-resolution
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
All semi-local longest common subsequences in subquadratic time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Longest common subsequences in permutations and maximum cliques in circle graphs
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximate colored range queries
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Adaptive spatial partitioning for multidimensional data streams
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
A subdivision approach to planar semi-algebraic sets
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Dynamic range majority data structures
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
A Monte Carlo strategy for data-based mathematical modeling
Mathematical and Computer Modelling: An International Journal
Fast approximate nearest-neighbor search with k-nearest neighbor graph
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
I/O-efficient spatial data structures for range queries
SIGSPATIAL Special
Cross-Document pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
Range majority in constant time and linear space
Information and Computation
Computing discriminating and generic words
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Generalizing the improved run-time complexity algorithm for non-dominated sorting
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Skyline operator on anti-correlated distributions
Proceedings of the VLDB Endowment
A fast and scalable multidimensional multiple-choice knapsack heuristic
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 48.26 |
Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss multidimensional divide-and-conquer, an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems. We use this paradigm to give best-known solutions to such problems as the ECDF, maxima, range searching, closest pair, and all nearest neighbor problems. The contributions of the paper are on two levels. On the first level are the particular algorithms and data structures given by applying the paradigm. On the second level is the more novel contribution of this paper: a detailed study of an algorithmic paradigm that is specific enough to be described precisely yet general enough to solve a wide variety of problems.