An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture

Details An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture

2006-01-18

arxiv.org/abs/cs/0601081v1

Computer Science

Data Structures and Algorithms

12 pages

Scientific paper

In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in $\Theta(\lg N)$ time under the comparison based model of computation.

Affiliated with

Also associated with

No associations

Rating

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449313