期刊
JOURNAL OF DISCRETE ALGORITHMS
卷 43, 期 -, 页码 72-80出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.jda.2016.09.002
关键词
Range Minimum Queries; Lowest common ancestors; Cartesian trees; Balanced Parentheses; Compact data structures
资金
- CONICYT, Chile [FB0001]
Fischer 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据