MPI-INF/SWS Research Reports 1991-2021
2. Number - All Departments
MPI-I-93-148
Lower bounds for merging on the hypercube
Rüb, Christine
October 1993, 10 pages.
.Status: available - back from printing
We show non-trivial lower bounds for several prefix problems in the
CRCW PRAM model. Our main result is an $\Omega(\alpha(n))$ lower bound
for the chaining problem, matching the previously known upper bound.
We give a reduction to show that the same lower bound applies to a
parenthesis matching problem, again matching the previously known
upper bound. We also give reductions to show that similar lower
bounds hold for the prefix maxima and the range maxima problems.
-
MPI-I-93-148.pdf
- Attachement: MPI-I-93-148.pdf (9040 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-148
BibTeX@TECHREPORT{Rueb93,
AUTHOR = {R{\"u}b, Christine},
TITLE = {Lower bounds for merging on the hypercube},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-93-148},
MONTH = {October},
YEAR = {1993},
ISSN = {0946-011X},
}