Simple and Efficient Fully-Functional Succinct Trees · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1601.06939/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTSimple and Efficient Fully-Functional Succinct Trees — mentioned by qazxcvbnmhttps://news.ycombinator.com/item?id=37506061urn:hackerpapers:mention:1601.06939:37506061Thu, 14 Sep 2023 07:34:30 GMT<p>Do succint trees like https://arxiv.org/pdf/1601.06939.pdf solve the same problems that stack monoids solve? I&#x27;ll take some more time to fully digest the contents of this family of problems, but on first glance they seem closely related, with the input Balanced Parentheses being precisely the &quot;BP&quot; succint tree representation. I&#x27;m not sure of it, but from my understanding it seems probable that building the succint tree can be parallelised.</p><p><a href="https://hackerpaper.kaipfister.de/p/1601.06939/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS