Find out how to access previewonly content
VLSI Algorithms and Architectures
Volume 319 of the series Lecture Notes in Computer Science pp 91100
Date:
Optimal parallel algorithms for expression tree evaluation and list ranking
 Richard ColeAffiliated withCourant Institute of Mathematical Sciences, New York UniversitySackler Faculty of Exact Sciences, Tel Aviv University
 , Uzi VishkinAffiliated withCourant Institute of Mathematical Sciences, New York UniversitySackler Faculty of Exact Sciences, Tel Aviv University
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.
 Title
 Optimal parallel algorithms for expression tree evaluation and list ranking
 Book Title
 VLSI Algorithms and Architectures
 Book Subtitle
 3rd Aegean Workshop on Computing, AWOC 88 Corfu, Greece, June 28 – July 1, 1988 Proceedings
 Pages
 pp 91100
 Copyright
 1988
 DOI
 10.1007/BFb0040377
 Print ISBN
 9780387968186
 Online ISBN
 9780387347707
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 319
 Series ISSN
 03029743
 Publisher
 Springer New York
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Editors
 Authors

 Richard Cole ^{(1)} ^{(2)}
 Uzi Vishkin ^{(1)} ^{(2)}
 Author Affiliations

 1. Courant Institute of Mathematical Sciences, New York University, USA
 2. Sackler Faculty of Exact Sciences, Tel Aviv University, Israel
Continue reading...
To view the rest of this content please follow the download PDF link above.