'The Graduate School of the Humanities, Utrecht University'
Abstract
We generalize the concept of Gabow and Tarjan's microsets [3] to dynamic microsets. The dynamic microsets allow the use of direct addressing in a RAM for incremental problems that can be partitioned into subproblems which are merged from time to time. A sequence of operations on dynamic microsets can be performed in O(n+m.a(m, n)) time, where n is the size of the problem and m is the number of queries
