Tight bounds on expected time to add correctly and add mostly correctly

Authors:
Peter Gemmell;Mor Harchol
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 3

Asynchronous Parallel Prefix Computation

IEEE Transactions on Computers
The Non-Recursive Power of Erroneous Computation

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The average time complexity to compute preffix functions in processor networks

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.89

Visualization

Abstract