Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Lower bounds for row minima searching

Bradford, Phillip G. and Reinert, Knut

MPI-I-96-1-029. November 1996, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-96-1-029.ps242 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Bradford, Phillip G. and Reinert, Knut},
  TITLE = {Lower bounds for row minima searching},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-96-1-029},
  MONTH = {November},
  YEAR = {1996},
  ISSN = {0946-011X},