Mehlhorn, K and Sundar, R and Uhrig, C (1997) Maintaining dynamic sequences under equality tests in polylogarithmic time. In: Algorithmica, 17 (2). pp. 183-198.
Maintaining_Dynamic_Sequences_under.pdf - Published Version
Restricted to Registered users only
Download (811Kb) | Request a copy
We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log(2) n) expected time where n is the length of the sequence created. The deterministic solution supports sequence creations in O(log n (log m log* m + log n)) time for the mth operation.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Springer.|
|Keywords:||Algorithms;Data structures;Derandomization;Randomization; Sequences.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||30 Jun 2011 14:39|
|Last Modified:||30 Jun 2011 14:39|
Actions (login required)