Transforming Comparison Model Lower Bounds to the PRAM

Forfattere

  • Dany Breslauer
  • Devdatt P. Dubhashi

DOI:

https://doi.org/10.7146/brics.v2i10.19513

Resumé

This note provides general transformations of lower bounds in Valiant's
parallel comparison decision tree model to lower bounds in the priority
concurrent-read concurrent-write parallel-random-access-machine model.
The proofs rely on standard Ramsey-theoretic arguments that simplify
the structure of the computation by restricting the input domain. The
transformation of comparison model lower bounds, which are usually easier
to obtain, to the parallel-random-access-machine, unifies some known
lower bounds and gives new lower bounds for several problems.

Downloads

Publiceret

1995-02-01

Citation/Eksport

Breslauer, D., & Dubhashi, D. P. (1995). Transforming Comparison Model Lower Bounds to the PRAM. BRICS Report Series, 2(10). https://doi.org/10.7146/brics.v2i10.19513

Nummer

Nr. 10 (1995): RS-10 Transforming Comparison Model Lower Bounds to the PRAM

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).