Show simple item record

Authordc.contributor.authorFerrada, Héctor 
Authordc.contributor.authorNavarro, Gonzalo 
Admission datedc.date.accessioned2018-05-22T21:09:31Z
Available datedc.date.available2018-05-22T21:09:31Z
Publication datedc.date.issued2017
Cita de ítemdc.identifier.citationJournal of Discrete Algorithms 43 (2017) 72–80es_ES
Identifierdc.identifier.other10.1016/j.jda.2016.09.002
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/148046
Abstractdc.description.abstractFischer and Heun [SICOMP 2011] proposed the first Range Minimum Query (RMQ) data structure on an array A[1, n] that uses 2n + o(n) bits and answers queries in O(1) time without accessing A. Their scheme converts the Cartesian tree of A into a general tree, which is represented using DFUDS. We show that, by using instead the BP representation, the formula becomes simpler since border conditions are eliminated. We also improve the current implementation of the BP representation for this purpose. This leads to the fastest and most compact practical implementation to date. (C) 2016 Elsevier B.V. All rights reserved.es_ES
Patrocinadordc.description.sponsorshipCONICYT, Chile, FB0001es_ES
Lenguagedc.language.isoenes_ES
Publisherdc.publisherElsevieres_ES
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Sourcedc.sourceJournal of Discrete Algorithmses_ES
Keywordsdc.subjectRange Minimum Querieses_ES
Keywordsdc.subjectLowest common ancestorses_ES
Keywordsdc.subjectCartesian treeses_ES
Keywordsdc.subjectBalanced Parentheseses_ES
Keywordsdc.subjectCompact data structureses_ES
Títulodc.titleImproved range minimum querieses_ES
Document typedc.typeArtículo de revista
Catalogueruchile.catalogadortjnes_ES
Indexationuchile.indexArtículo de publicación ISIes_ES


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile