dc.creator | Córdova Monroy, Joshimar | |
dc.creator | Navarro, Gonzalo | |
dc.date.accessioned | 2018-03-20T19:45:52Z | |
dc.date.available | 2018-03-20T19:45:52Z | |
dc.date.created | 2018-03-20T19:45:52Z | |
dc.date.issued | 2016-12-20 | |
dc.identifier | Theoretical Computer Science 656 (2016) 135–145 | |
dc.identifier | 10.1016/j.tcs.2016.04.031 | |
dc.identifier | https://repositorio.uchile.cl/handle/2250/146915 | |
dc.description.abstract | The fully-functional succinct tree representation of Navarro and Sadakane (2014) [10] supports a large number of operations in constant time using 2n + o(n) bits. However, the full idea is hard to implement. Only a simplified version with O(lgn) operation time has been implemented and shown to be practical and competitive. We describe a new variant of the original idea that is much simpler to implement and has worst-case time O(lglgn) for the operations. An implementation based on this version is experimentally shown to be superior to existing implementations. | |
dc.language | en | |
dc.publisher | Elsevier | |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Chile | |
dc.source | Theoretical Computer Science | |
dc.subject | Succinct data structures | |
dc.subject | Ordinal trees | |
dc.title | Simple and efficient fully-functional succinct trees | |
dc.type | Artículo de revista | |