On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)

Volumn 22, Issue 4, 1975, Pages 469-476

  Kung, H T ^a   Luccio, F ^b   Preparata, F P ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

algorithm; computattonal complexity; maxima of a set of vectors; number of comparisons; recurrence

Indexed keywords

MATHEMATICAL PROGRAMMING;

EID: 0016564037     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321906.321910     Document Type: Article

References (4)

1. Knuth, D. E. The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley, Reading, Mass, 1973.
2. Kung, H. T. On the computational complexity of finding the maxima of a set of vectors Proc 15th Annual IEEE Symp. on Switching and Automata Theory, Oct. 1974, pp. 117-121.
3. Luccio, F., and Preparata, F. P. On finding the maxima of a set of vectors. Istituto di Scienze dell'Informazione, Università di Pisa, 56100 Pisa, Italy, Dec. 1973.
4. Yao, F. F. On finding the maximal elements in a set of plane vectors Comput. Sci. Dep Rep, U. of Illinois at Urbana-Champaign, Urbana, ill., July 1974.