Research Interests
- Space Efficient Data Structures
- Range Queries
- Computational Geometry
- I/O Efficient Algorithms
- Combinatorial Algorithms
- Bioinformatics
|
Current Research
- Set Intersection Queries
- Matrix-Vector Multiplication
- Range Minimum Queries
- Dynamic Optimality
- Shortest Interval and Min-Convolution Problems
- Succinct Binary Trees for Range Minimum Queries
|
Publications
Two Dimensional Range Diameter Queries.
Pooya Davoodi, Michiel Smid, Freek van Walderveen
To appear in LATIN 2012.
|
Data Structures: Range Queries and Space Efficiency.
Pooya Davoodi
Ph.D. Thesis, May 2011.
Ph.D. Defense: Aarhus University (pptx)
|
Path Minima Queries in Dynamic Weighted Trees (Full Version).
Gerth S. Brodal, Pooya Davoodi, S. Srinivasa Rao.
In WADS 2011 .
Talk: MADALGO (pptx)
|
Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet.
Pooya Davoodi and S. Srinivasa Rao.
In TAMC 2011 .
Talk: TAMC'11 (pptx)-MADALGO (pptx)
|
On Space Efficient Two Dimensional Range Minimum Data Structures.
Gerth S. Brodal, Pooya Davoodi, S. Srinivasa Rao.
In ESA 2010 .
To appear in Algorithmica, Special Issue of ESA 2010.
Talk: MADALGO(pdf)-MADALGO (pptx)
|
Finding Motifs Based on Suffix Trie.
F. Zare-Mirakabad, P. Davoodi, H. Ahrabian, A. Nowzari-Dalini, M. Sadeghi, B. Goliaei.
In Advanced Modeling and Optimization, volume 11(2), pages 177-194, 2009.
|
|
Polytechnic Institute of NYU
Department of Computer Science and Engineering
2 MetroTech Center
Brooklyn, New York 11201
Office: 10.089
|
Email: pooyadavoodi At gmail.com
Mobile: +1 (646) 410-7739
|
|
