Succinct Representations of Binary Trees for Range Minimum Queries - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti. Succinct Representations of Binary Trees for Range Minimum Queries. In Joachim Gudmundsson, Julián Mestre, Taso Viglas, editors, Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Volume 7434 of Lecture Notes in Computer Science, pages 396-407, Springer, 2012. [doi]

This author has not been identified. Look up 'Pooya Davoodi' in GoogleThis author has not been identified. Look up 'Rajeev Raman' in GoogleThis author has not been identified. Look up 'Srinivasa Rao Satti' in Google

runs on WebDSL