Add to ORKGIn 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 Θ(lgN) time under the comparison based model of computation.<p>Godkänd; 2006; 20071119 (ysko)</p
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pa...
AbstractThe prefix-sum operation, which returns all prefix sums on a sequence of numbers, plays an i...
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to ...
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of ...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Abstract: "Experienced algorithm designers rely heavily on a set of building blocks and on the tools...
In this thesis we study the limitations of data structures and how they can be overcome through care...
AbstractWe consider the Block PRAM model of Aggarwal et al. (in "Proceedings, First Annual ACM Sympo...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
A prefix search returns the strings out of a given collection S that start with a given prefix. Trad...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pa...
AbstractThe prefix-sum operation, which returns all prefix sums on a sequence of numbers, plays an i...
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to ...
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of ...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Abstract: "Experienced algorithm designers rely heavily on a set of building blocks and on the tools...
In this thesis we study the limitations of data structures and how they can be overcome through care...
AbstractWe consider the Block PRAM model of Aggarwal et al. (in "Proceedings, First Annual ACM Sympo...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
A prefix search returns the strings out of a given collection S that start with a given prefix. Trad...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pa...
AbstractThe prefix-sum operation, which returns all prefix sums on a sequence of numbers, plays an i...