https://hackerpaper.kaipfister.de/p/0905.0768/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=40698552urn:hackerpapers:mention:0905.0768:40698552Sun, 16 Jun 2024 17:10:02 GMT<p>On trees - how could we neglect the Succinct trees? Succinctness - expressing trees with as little bits as entropically possible. The representation is as simple as it could be - simply write down nested parentheses whose abstract syntax tree is your given tree. Practically all tree operations in logarithmic or constant time. How it works - recursively with range-min trees and range-max trees - simple and elegant number theory. A primer - https://arxiv.org/pdf/0905.0768</p><p><a href="https://hackerpaper.kaipfister.de/p/0905.0768/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS