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 offline 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 dynamic 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...
The batched static version of a searching problem asks for performing a given set of queries on a gi...
In this paper we study the efficiency of general methods for converting static data structures to dy...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Abstract. A data structure is said to be persistent when any update operation returns a new structur...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
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 ...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
The batched static version of a searching problem asks for performing a given set of queries on a gi...
In this paper we study the efficiency of general methods for converting static data structures to dy...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Abstract. A data structure is said to be persistent when any update operation returns a new structur...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
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 ...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
The batched static version of a searching problem asks for performing a given set of queries on a gi...
In this paper we study the efficiency of general methods for converting static data structures to dy...