Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. - Pooya Davoodi; S. Srinivasa Rao 001 (TAMC, 2011)

Path Minima Queries in Dynamic Weighted Trees. - Gerth Stølting Brodal; Pooya Davoodi; S. Srinivasa Rao 001 (WADS, 2011)

Succinct Representations of Binary Trees for Range Minimum Queries. - Pooya Davoodi; Rajeev Raman; Srinivasa Rao Satti (COCOON, 2012)

Two-Dimensional Range Diameter Queries. - Pooya Davoodi; Michiel H. M. Smid; Freek van Walderveen (LATIN, 2012)

On Space Efficient Two Dimensional Range Minimum Data Structures. - Gerth Stølting Brodal; Pooya Davoodi; S. Srinivasa Rao 001 (Algorithmica, 2012)

The Encoding Complexity of Two Dimensional Range Minimum Data Structures. - Gerth Stølting Brodal; Andrej Brodnik; Pooya Davoodi (ESA, 2013)

Encoding Range Minimum Queries. - Pooya Davoodi; Gonzalo Navarro 001; Rajeev Raman; S. Srinivasa Rao 001 (CoRR, 2013)

Cache-Oblivious Persistence. - Pooya Davoodi; Jeremy T. Fineman; John Iacono; Özgür Özkan (ESA, 2014)

Range Minimum Query Indexes in Higher Dimensions. - Pooya Davoodi; John Iacono; Gad M. Landau; Moshe Lewenstein (CPM, 2015)

Succinct Dynamic Cardinal Trees. - Diego Arroyuelo; Pooya Davoodi; Srinivasa Rao Satti (Algorithmica, 2016)

Two dimensional range minimum queries and Fibonacci lattices. - Gerth Stølting Brodal; Pooya Davoodi; Moshe Lewenstein; Rajeev Raman; Srinivasa Rao Satti (Theor. Comput. Sci., 2016)

On Succinct Representations of Binary Trees. - Pooya Davoodi; Rajeev Raman; Srinivasa Rao Satti (Math. Comput. Sci., 2017)