An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture
Data Structures and Algorithms
2007-05-23 v1 Computational Complexity
Information Retrieval
Abstract
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 time under the comparison based model of computation.
Keywords
Cite
@article{arxiv.cs/0601081,
title = {An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture},
author = {Andrej Brodnik and Johan Karlsson and J. Ian Munro and Andreas Nilsson},
journal= {arXiv preprint arXiv:cs/0601081},
year = {2007}
}
Comments
12 pages