Add to ORKGWe present a data structure that allows to maintain in logarithmic time all partial sums of elements of a linear array during incremental changes of element’s values. Key words: Partial sums; Data structures; Algorithms
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...
We present a novel approach for computing all maximum consecutive subsums in a sequence of positiv...
Abstract. We develop succinct data structures to represent (i) a se-quence of values to support part...
We show how to store a searchable partial-sums data structure with constant query time for a static ...
Gusfield D, Stoye J. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
A novel data structure that enables the storage and retrieval of linear array numeric data with loga...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
extended abstractA data structure is partially persistent if previous versions remain available for ...
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, ...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
In this paper we present an extension of the class of piecewise linear algorithms (PLAs) in order to...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...
We present a novel approach for computing all maximum consecutive subsums in a sequence of positiv...
Abstract. We develop succinct data structures to represent (i) a se-quence of values to support part...
We show how to store a searchable partial-sums data structure with constant query time for a static ...
Gusfield D, Stoye J. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
A novel data structure that enables the storage and retrieval of linear array numeric data with loga...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
extended abstractA data structure is partially persistent if previous versions remain available for ...
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, ...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
In this paper we present an extension of the class of piecewise linear algorithms (PLAs) in order to...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...
We present a novel approach for computing all maximum consecutive subsums in a sequence of positiv...