Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Rank and select revisited and extended
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Improved data structures for the orthogonal range successor problem
Computational Geometry: Theory and Applications
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Dynamic planar range maxima queries
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient data structures for the factor periodicity problem
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Compact binary relation representations with rich functionality
Information and Computation
On reporting the L1 metric closest pair in a query rectangle
Information Processing Letters
| Hi-index | 0.00 |
We consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their x-coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. Moreover, our results generalize and improve the previously known results for the orthogonal range successor problem and can be used to obtain better solutions for some stringology problems.