11 ms·
They are related, thanks for the pointer! The representation of the tree is very similar, as are the techniques to get better than O(log n) - the work efficienc
by raphlinus 3y ago
They are related, thanks for the pointer! The representation of the tree is very similar, as are the techniques to get better than O(log n) - the work efficiency stuff. I'll add a reference to that if/when I do a published version. That said, I am unaware of any publications on parallel implementations of succinct trees.
- qazxcvbnm 3y agoWhile I was reading up further on succint trees, I noticed this https://web.cs.dal.ca/~mhe/publications/sea15_parallelsuccinctrees.pdf https://web.cs.dal.ca/~mhe/publications/sea15_parallelsuccin... . I've not gone through it thoroughly yet, but it seems that someone has done it.