The following publications are possibly variants of this publication:
- On Succinct Representations of Binary TreesPooya Davoodi, Rajeev Raman, Srinivasa Rao Satti. mics, 11(2):177-189, 2017. [doi]
- Succinct Dynamic Dictionaries and TreesRajeev Raman, S. Srinivasa Rao. icalp 2003: 357-368 [doi]
- Dynamic Succinct Ordered TreesArash Farzan, J. Ian Munro. icalp 2009: 439-450 [doi]
- Succinct representation of dynamic treesArash Farzan, J. Ian Munro. TCS, 412(24):2668-2678, 2011. [doi]
- Succinct Representations of Binary Trees for Range Minimum QueriesPooya Davoodi, Rajeev Raman, Srinivasa Rao Satti. cocoon 2012: 396-407 [doi]
- Succinct indexes for strings, binary relations and multilabeled treesJérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti. TALG, 7(4):52, 2011. [doi]
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured DocumentsJérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao. cpm 2006: 24-35 [doi]
- Adaptive searching in succinctly encoded binary relations and tree-structured documentsJérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao. TCS, 387(3):284-297, 2007. [doi]