Optimal deterministic approximate parallel prefix sums and their applications

Tal Goldberg, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that extremely accurate approximation to the prefix sums of a sequence of n integers can be computed deterministically in O(log log n) time using O(n/log log n) processors in the COMMON CRCW PRAM model. This complements randomized approximation methods obtained recently by Goodrich, Matias and Vishkin, (1993) and improves previous deterministic results obtained by Hagerup and Raman. Furthermore, our results completely match a lower bound obtained recently by Chaudhuri. Our results have many applications. Using them we improve upon the best known time bounds for deterministic approximate selection and for deterministic padded sorting.

Original languageEnglish
Title of host publicationProceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages220-228
Number of pages9
ISBN (Electronic)0818669152, 9780818669156
DOIs
StatePublished - 1995
Event3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel
Duration: 4 Jan 19956 Jan 1995

Publication series

NameProceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Conference

Conference3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/TerritoryIsrael
CityTel Aviv
Period4/01/956/01/95

Fingerprint

Dive into the research topics of 'Optimal deterministic approximate parallel prefix sums and their applications'. Together they form a unique fingerprint.

Cite this