Add to ORKGWe consider dynamic data structures in which updates rebuild a static solution. Space bounds for persistent versions of these structures can often be reduced by using an offiine persistent data structure in place of the static solution. We apply this technique to decomposable search problems, to dynamic linear programming, and to maintaining the minimum spanning tree in a dynarnic graph. Our algorithms admit trade-offs of update time vs. query time, and of time vs. space
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
Abstract. A data structure is said to be persistent when any update operation returns a new structur...
We answer a basic data structuring question (for example, raised by Dietz and Raman [1991]): can van...
extended abstractA data structure is partially persistent if previous versions remain available for ...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
Abstract. A data structure is said to be persistent when any update operation returns a new structur...
We answer a basic data structuring question (for example, raised by Dietz and Raman [1991]): can van...
extended abstractA data structure is partially persistent if previous versions remain available for ...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...