AbstractWe obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models
An incremental algorithm (also called a dynamic update algorithm) updates the answer to some problem...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractWe consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, c...
In the last lecture we considered the problem of finding the predecessor in its static version. We a...
In this lecture, we discuss lower bounds on the cell-probe complexity of the static predecessor prob...
We consider the problem of maintaining a set of $n$ integers in the range $0..2^{w}-1$ under the ope...
Abstract. We consider the problem of maintaining a set of n integers in the range 0::2 w 1 under th...
We consider the problem of maintaining a dynamic ordered set of n integers in the range 0 : : 2^w - ...
AbstractWe consider a fundamental problem in data structures, static predecessor searching: Given a ...
AbstractThis work present several advances in the understanding of dynamic data structures in the bi...
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the mode...
• The predecessor problem: Maintain a set S ⊆ U = {0,..., u-1} under operations • predecessor(x): re...
Abstract. We give lower and upper bounds for the batched predecessor problem in external memory. We ...
Abstract We introduce new models for dynamic computation based on the cell probe model of Fredman an...
We present highly optimized data structures for the dynamic predecessor problem, where the task is t...
An incremental algorithm (also called a dynamic update algorithm) updates the answer to some problem...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractWe consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, c...
In the last lecture we considered the problem of finding the predecessor in its static version. We a...
In this lecture, we discuss lower bounds on the cell-probe complexity of the static predecessor prob...
We consider the problem of maintaining a set of $n$ integers in the range $0..2^{w}-1$ under the ope...
Abstract. We consider the problem of maintaining a set of n integers in the range 0::2 w 1 under th...
We consider the problem of maintaining a dynamic ordered set of n integers in the range 0 : : 2^w - ...
AbstractWe consider a fundamental problem in data structures, static predecessor searching: Given a ...
AbstractThis work present several advances in the understanding of dynamic data structures in the bi...
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the mode...
• The predecessor problem: Maintain a set S ⊆ U = {0,..., u-1} under operations • predecessor(x): re...
Abstract. We give lower and upper bounds for the batched predecessor problem in external memory. We ...
Abstract We introduce new models for dynamic computation based on the cell probe model of Fredman an...
We present highly optimized data structures for the dynamic predecessor problem, where the task is t...
An incremental algorithm (also called a dynamic update algorithm) updates the answer to some problem...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractWe consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, c...
DOI
Add to ORKG