Lower bounds for merging on the hypercube

Rüb, Christine

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Lower bounds for merging on the hypercube

MPS-Authors

/persons/resource/persons45318

Rüb, Christine
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-93-148.pdf
(Any fulltext), 9MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Rüb, C.(1993). Lower bounds for merging on the hypercube (MPI-I-93-148). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B768-4

Abstract

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.