Optimal parallel algorithms for expression tree evaluation and list ranking

Richard Cole, Uzi Vishkin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.

Original languageEnglish (US)
Title of host publicationVLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings
PublisherSpringer Verlag
Pages91-100
Number of pages10
Volume319 LNCS
ISBN (Print)9780387968186
DOIs
StatePublished - Jan 1 1988
Event3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 - Corfu, Greece
Duration: Jun 28 1988Jul 1 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume319 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988
CountryGreece
CityCorfu
Period6/28/887/1/88

Fingerprint

Optimal Algorithm
Parallel algorithms
Parallel Algorithms
Ranking
Evaluation
Deterministic Algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cole, R., & Vishkin, U. (1988). Optimal parallel algorithms for expression tree evaluation and list ranking. In VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings (Vol. 319 LNCS, pp. 91-100). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 319 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0040377

Optimal parallel algorithms for expression tree evaluation and list ranking. / Cole, Richard; Vishkin, Uzi.

VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Vol. 319 LNCS Springer Verlag, 1988. p. 91-100 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 319 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Vishkin, U 1988, Optimal parallel algorithms for expression tree evaluation and list ranking. in VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. vol. 319 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 319 LNCS, Springer Verlag, pp. 91-100, 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988, Corfu, Greece, 6/28/88. https://doi.org/10.1007/BFb0040377
Cole R, Vishkin U. Optimal parallel algorithms for expression tree evaluation and list ranking. In VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Vol. 319 LNCS. Springer Verlag. 1988. p. 91-100. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0040377
Cole, Richard ; Vishkin, Uzi. / Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Vol. 319 LNCS Springer Verlag, 1988. pp. 91-100 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{111efefad45544b887b4563965a01c39,
title = "Optimal parallel algorithms for expression tree evaluation and list ranking",
abstract = "Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.",
author = "Richard Cole and Uzi Vishkin",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/BFb0040377",
language = "English (US)",
isbn = "9780387968186",
volume = "319 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "91--100",
booktitle = "VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Optimal parallel algorithms for expression tree evaluation and list ranking

AU - Cole, Richard

AU - Vishkin, Uzi

PY - 1988/1/1

Y1 - 1988/1/1

N2 - Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.

AB - Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.

UR - http://www.scopus.com/inward/record.url?scp=85013954632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013954632&partnerID=8YFLogxK

U2 - 10.1007/BFb0040377

DO - 10.1007/BFb0040377

M3 - Conference contribution

SN - 9780387968186

VL - 319 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 91

EP - 100

BT - VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings

PB - Springer Verlag

ER -