7 - Parentheses
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 167 - 210Publisher: Cambridge University PressPrint publication year: 2016
References
, , , and (2010). Succinct trees in practice. In Proc. 12th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 84–97.Google Scholar
, , , and (2012). Succinct representation of labeled graphs. Algorithmica, 62(1–2), 224–257.Google Scholar
and (2004). The level ancestor problem simplified. Theoretical Computer Science, 321(1), 5–12.Google Scholar
, , , , and (2005). Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57(2), 75–94.Google Scholar
and (1993). Recursive star-tree parallel data structure. SIAM Journal on Computing, 22(2), 221–242.Google Scholar
and (1994). Finding level-ancestors in trees. Journal of Computer and System Sciences, 48(2), 214–230.Google Scholar
, , and (2005).Orderly spanning treeswith applications. SIAM Journal on Computing, 34(4), 924–945.Google Scholar
, , , , and (1998). Compact encodings of planar graphs via canonical orderings and multiple parentheses. In Proc. 25th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1443, pages 118–129.Google Scholar
and (2016). Simple and efficient fully-functional succinct trees. CoRR, abs/1601.06939. http://arxiv.org/abs/1601.06939.
and (2006). Elements of Information Theory. Wiley, 2nd edition.
and (2016). Improved range minimum queries. In Proc. 26th Data Compression Conference (DCC), pages 516–525.Google Scholar
and (2011). Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM Journal on Computing, 40(2), 465–492.Google Scholar
, , and (1984). Scaling and related techniques for geometry problems. In Proc. 16th ACM Symposium on Theory of Computing (STOC), pages 135–143.Google Scholar
and (2008). On compact encoding of pagenumber. Discrete Mathematics and Theoretical Computer Science, 10(3), 23–24.Google Scholar
, , , and (2006). A simple optimal representation for balanced parentheses. Theoretical Computer Science, 368(3), 231–246.Google Scholar
(1989). Space-efficient static trees and graphs. In Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pages 549–554.Google Scholar
and (2008). Balanced parentheses strike back. ACM Transactions on Algorithms, 4(3), 1–13.Google Scholar
and (2001). Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3), 762–776.Google Scholar
, , , and (2012). Succinct representations of permutations and functions. Theoretical Computer Science, 438, 74–88.Google Scholar
and (2014). Fully-functional static and dynamic succinct trees. ACMTransactions on Algorithms, 10(3), article 16.Google Scholar
, , and (2011). Fully-compressed suffix trees. ACM Transactions on Algorithms, 7(4), article 53.Google Scholar
(2007). Compressed suffix trees with full functionality. Theory of Computing Systems, 41(4), 589–607.Google Scholar
(2013). Broadword implementation of parenthesis queries. CoRR, abs/1301.5468. http:// arxiv.org/abs/1301.5468.
and (2010). Data structures for range minimum queries in multidimensional arrays. In Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 150–160.Google Scholar