Notas Hellout

https://arxiv.org/abs/1806.06726

https://en.wikipedia.org/wiki/Link/cut_tree

https://en.wikipedia.org/wiki/Treap

https://en.wikipedia.org/wiki/Fusion_tree

Chan's algorithm [SoCG16] encode data as a polynomial A(x) = (sum f(x_i)^p)^(1/p) approx f. = n^(1/p) C(x) = (sum i f(x_i)^p)^(1/p) p = 1/e log n C(x)/A(x) insert / delete...

http://en.wikipedia.org/wiki/Binary_tree#Succinct_encodings

implement a partition refinement data structure

1

http://en.wikipedia.org/wiki/Partition_refinement