In our bachelor thesis, we described an implicit data structure that, given a way to maintain an implicit representation of polylogarithmic buckets, could implement all the dynamic ordered dictionary operations in logarithmic time. We now fulfill our obligation and provide a corresponding construction of implicit buckets. 1
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:416018 |
Date | January 2020 |
Creators | Lieskovský, Matej |
Contributors | Mareš, Martin, Majerech, Vladan |
Source Sets | Czech ETDs |
Language | English |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0014 seconds