On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
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
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
Efficient perspective-accurate silhouette computation and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast Range Searching with Delaunay Triangulations
Geoinformatica
Using Geometric Hashing To Repair CAD Objects
IEEE Computational Science & Engineering
The level-ancestor problem on pure pointer machines
Information Processing Letters
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Rectilinear Static and Dynamic Discrete 2-center Problems
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Optimal Facility Location under Various Distance Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Indexing Text Using the Ziv-Lempel Trie
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Dynamic multidimensional data cubes
Multidimensional databases
An efficient range search algorithm for visualizing extrema of volume data
VIS '92 Proceedings of the 3rd conference on Visualization '92
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Indexing text using the Ziv-Lempel trie
Journal of Discrete Algorithms - SPIRE 2002
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Cache-oblivious planar orthogonal range searching and counting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Rank and select revisited and extended
Theoretical Computer Science
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Output-sensitive autocompletion search
Information Retrieval
A compressed self-index using a Ziv---Lempel dictionary
Information Retrieval
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate colored range and point enclosure queries
Journal of Discrete Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Computational Geometry: Theory and Applications
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
A general approach for cache-oblivious range reporting and approximate range counting
Proceedings of the twenty-fifth annual symposium on Computational geometry
Space Efficient Multi-dimensional Range Reporting
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Range Quantile Queries: Another Virtue of Wavelet Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Multiple genome alignment: chaining algorithms revisited
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A general approach for cache-oblivious range reporting and approximate range counting
Computational Geometry: Theory and Applications
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A fun application of compact data structures to indexing geographic data
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Algorithms and theory of computation handbook
Extracting powers and periods in a string from its runs structure
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Efficient top-k queries for orthogonal ranges
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Inverted indexes for phrases and strings
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Space efficient data structures for dynamic orthogonal range counting
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Reducing the space requirement of LZ-Index
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Output-Sensitive autocompletion search
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A compressed self-index using a ziv-lempel dictionary
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Approximate colored range queries
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Hamiltonian orthogeodesic alternating paths
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
GD'11 Proceedings of the 19th international conference on Graph Drawing
A dynamic stabbing-max data structure with sub-logarithmic query time
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Space-efficient data-analysis queries on grids
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
External memory orthogonal range reporting with fast updates
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
Succinct indices for range queries with applications to orthogonal range maxima
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hamiltonian orthogeodesic alternating paths
Journal of Discrete Algorithms
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
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
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Range majority in constant time and linear space
Information and Computation
Space-efficient data-analysis queries on grids
Theoretical Computer Science
Space efficient data structures for dynamic orthogonal range counting
Computational Geometry: Theory and Applications
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Compressed property suffix trees
Information and Computation
Journal of Discrete Algorithms
| Hi-index | 0.01 |