Optimal deterministic approximate parallel prefix sums and their applications

Tal Goldberg; Uri Zwick

doi:10.1109/ISTCS.1995.377028

Optimal deterministic approximate parallel prefix sums and their applications

Tal Goldberg, Uri Zwick

School of Computer Science

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

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 language	English
Title of host publication	Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	220-228
Number of pages	9
ISBN (Electronic)	0818669152, 9780818669156
DOIs	https://doi.org/10.1109/ISTCS.1995.377028
State	Published - 1995
Event	3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel Duration: 4 Jan 1995 → 6 Jan 1995

Publication series

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

Conference

Conference	3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/Territory	Israel
City	Tel Aviv
Period	4/01/95 → 6/01/95

Funding

Funders	Funder number
Basic Research Foundation
Israel Academy of Sciences and Humanities

Access to Document

10.1109/ISTCS.1995.377028

Cite this

Goldberg, T., & Zwick, U. (1995). Optimal deterministic approximate parallel prefix sums and their applications. In Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems (pp. 220-228). Article 377028 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISTCS.1995.377028

@inproceedings{53549747ef6442309049311629b83cb5,

title = "Optimal deterministic approximate parallel prefix sums and their applications",

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.",

author = "Tal Goldberg and Uri Zwick",

note = "Publisher Copyright: {\textcopyright} 1995 IEEE.; 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 ; Conference date: 04-01-1995 Through 06-01-1995",

year = "1995",

doi = "10.1109/ISTCS.1995.377028",

language = "אנגלית",

series = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "220--228",

booktitle = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

address = "ארצות הברית",

}

Goldberg, T & Zwick, U 1995, Optimal deterministic approximate parallel prefix sums and their applications. in Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems., 377028, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems, Institute of Electrical and Electronics Engineers Inc., pp. 220-228, 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, 4/01/95. https://doi.org/10.1109/ISTCS.1995.377028

Optimal deterministic approximate parallel prefix sums and their applications. / Goldberg, Tal; Zwick, Uri.
Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc., 1995. p. 220-228 377028 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal deterministic approximate parallel prefix sums and their applications

AU - Goldberg, Tal

AU - Zwick, Uri

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

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

U2 - 10.1109/ISTCS.1995.377028

DO - 10.1109/ISTCS.1995.377028

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85057122781

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

SP - 220

EP - 228

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 4 January 1995 through 6 January 1995

ER -

Goldberg T, Zwick U. Optimal deterministic approximate parallel prefix sums and their applications. In Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc. 1995. p. 220-228. 377028. (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems). doi: 10.1109/ISTCS.1995.377028

Optimal deterministic approximate parallel prefix sums and their applications

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this