de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Maintaining dynamic sequences under equality-tests in polylogorithmic time

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45646

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-93-128.pdf
(beliebiger Volltext), 124KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B425-3
Zusammenfassung
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.