@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",
note = "Funding Information: ~:This research was supporte.d in part by NSF grants DCR-84-01633 and CCR-8702271, ONR grant N00014-85-K-0046 and by an IBM faculty development award. tThis research was supported in part by NSF grants NSF-CCR-8615337 and NSF-DCR-8413359, ONR grant N00014-85-K-0046, by the Applied Mathematic~ Science subprogram of the office of Energy Research, U.S. Department of Energy under contract number DE-AC02-76ER03077, and by the Foundation for Research in Electronics, Computers and Communication, Administered by the Israeli Academy of Sciences and Humanities. Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 ; Conference date: 28-06-1988 Through 01-07-1988",
year = "1988",
doi = "10.1007/BFb0040377",
language = "English (US)",
isbn = "9780387968186",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "91--100",
editor = "Reif, {John H.}",
booktitle = "VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings",
}