English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Maintaining dynamic sequences under equality-tests in polylogorithmic time

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45646

Uhrig,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-93-128.pdf
(Any fulltext), 124KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K., & Uhrig, C.(1993). Maintaining dynamic sequences under equality-tests in polylogorithmic time (MPI-I-93-128). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B425-3
Abstract
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 $m$--th operation.