ABSTRACT

Computing max{a<inf>1</inf>+ b<inf>1</inf>, a<inf>2</inf>+ b<inf>2</inf>, ... ,a<inf>n</inf>+ b<inf>n</inf>} trivially takes n additions. We show that if we are given the ranking for the a's and the b's separately, then an algorithm exists which will compute the maximum in ?2n additions on the average. This can be generalized to yield an efficient algorithm to compute max{h(a<inf>1</inf>,b<inf>1</

INDEX TERMS

ranking, Analysis of algorithms, average complexity, computational geometry, maximum norm, pattern classification

CITATION

V. Konard, "Efficient Computation of the Maximum of the Sum of Two Sequences and Applications",

*IEEE Transactions on Computers*, vol. 35, no. , pp. 651-653, July 1986, doi:10.1109/TC.1986.1676809CITATIONS

SEARCH