Dominance made simple

Information Processing Letters

Volumn 109, Issue 9, 2009, Pages 419-421

  Saxena, Sanjeev ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Algorithms; Computational geometry; Dominance query; Orthogonal range query; Parallel algorithms; Range query

Indexed keywords

BINARY TREES; COMPUTATIONAL GEOMETRY; PARALLEL PROCESSING SYSTEMS;

DOMINANCE QUERY; ORTHOGONAL RANGE QUERY; PRE-PROCESSING; RANGE QUERY; THREE DIMENSIONS; TIME BOUNDS;

PARALLEL ALGORITHMS;

EID: 61649085867     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.12.006     Document Type: Article

References (8)

1. M.J. Attallah, M.T. Goodrich, Efficient plane sweeping in parallel (preliminary version), in: Proc. Second Ann. ACM Symp. Computational Geometry, 1986, pp. 216-225
2. Berkman O., Matias Y., and Ragde P. Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. J. Algorithms 28 (1998) 197-215
3. Berkman O., Schieber B., and Vishkin U. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms 14 (1993) 344-370
4. Chazelle B., and Guibas L.J. Fractional cascading I. A data structure technique. Algorithmica 1 (1986) 133-162
5. Cole R. Parallel merge sort. SIAM J. Comput. 17 (1988) 770-785
6. Makris C., and Tsakaldis A.K. Algorithms for three-dimensional dominance searching in linear space. Inform. Process. Lett. 66 (1998) 277-283
7. Shi Q., and JaJa J. Fast algorithms for 3-D dominance reporting and counting. Int. J. Found. Comp. Sci. 15 (2004) 673-684
8. Tamassia R., and Vitter J.S. Optimal cooperative search in fractional cascaded data structures. Algorithmica 15 (1996) 154-171