@techreport{BradfordReinert96,
TITLE = {Lower bounds for row minima searching},
AUTHOR = {Bradford, Phillip Gnassi and Reinert, Knut},
LANGUAGE = {eng},
NUMBER = {MPI-I-1996-1-029},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {1996},
DATE = {1996},
ABSTRACT = {This paper shows that finding the row minima (maxima) in an $n \times n$ totally monotone matrix in the worst case requires any algorithm to make $3n-5$ comparisons or $4n -5$ matrix accesses. Where the, so called, SMAWK algorithm of Aggarwal {\em et al\/.} finds the row minima in no more than $5n -2 \lg n -- 6$ comparisons.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}