|
Research Interests
Current Research
|
| 2008-2011 | Ph.D. in computer science MADALGO, Aarhus University, Denmark Advisor: Gerth Stølting Brodal Thesis: Data Structures: Range Queries and Space Efficiency (last revision: May 5, 2011) |
| 2004-2007 | M.Sc. in computer science University of Tehran, Iran Advisor: Abbas Nowzari Dalini Thesis: Bioinformatics, Pattern Discovery In Genomes (In Persian) Title and Abstract (In English) |
| 1999-2004 | B.Sc. in computer science University of Tehran, Iran |
|
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. |
| Jun-Aug 2010 | Carleton University, Canada Visiting Researcher Hosts: Prosenjit Bose, Anil Maheshwari, Pat Morin, and Michiel Smid |
| Feb-Mar 2010 | University of Leicester, United Kingdom Visiting Researcher Host: Rajeev Raman |
| 2007-2008 | AMM (Abadeihaye Moghime Markaz), A loan company, Iran Software Developer Implemented the application Sandogh |
| 2004-2008 | UAST (ACECR-Sharif University Branch), Iran Instructor of Computer Science Courses Selected Courses: C/C++, C#, HTML, MS Office, Algorithms and Data Structures, Compilers, Fundamentals of Computers |
| 2005-2007 | University of Tehran, Iran Instructor of Computer Science Courses Courses: HTML, JavaScript, Fundamentals of Computers |
| 2004 | Ghalamchi Scientific-Educational Foundation, Iran Educational Consultant |
| 2007 | UAST (ACECR-Sharif University Branch), Iran Undergraduate Project Supervisor Supervised 19 programming projects |
| Spring 2007 | UAST (ACECR-Sharif University Branch), Iran Organized a workshop on Programming and Graphics Design |
| Jun-Aug 2010 | Carleton University, Ottawa, Canada. |
| Feb-Mar 2010 | Rajeev Raman, University of Leicester, Leicester, UK. |
| August 2011 | Path Minima Queries on Dynamic Weighted Trees, WADS'11, NYC, United States. |
| May 2011 | Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet, MADALGO, Aarhus University, Denmark. |
| Nov 2010 | Path Minima Queries on Dynamic Weighted Trees, MADALGO, Aarhus University, Denmark. |
| Sep 2010 | On Space Efficient Two Dimensional Range Minimum Data Structures, MADALGO, Aarhus University, Denmark. |
| Jun 2010 | On Space Efficient Two Dimensional Range Minimum Data Structures, Carleton University, Ottawa, Canada. |
| Feb 2010 | On Space Efficient Two Dimensional Range Minimum Data Structures, University of Leicester, Leicester, UK. |
| Aug 2011 | WADS, NYC, United States. |
| Aug 2010 | CCCG, Winnipeg, Canada. |
| Jun 2009 | SoCG, Aarhus, Denmark. |
| Jun 2009 | MASSIVE, Aarhus, Denmark. |
| Aug 2008 | MADALGO Summer School on Cache Oblivious Algorithms, Aarhus, Denmark. |
| 2009 | Randomized Algorithms A program for a multiple choice test written in C++ (source code). A program for equality testing of multisets written in C++ (source code). Project Description Project Report |
| 2009 | IO Algorithms IO efficient merge sort and heap sort programs written in C++ and evaluating their resource usage in compare to their non-IO efficient versions. |
| 2008 | Computational Geometry A program written in C++ to solve the line segment intersection and point location problems with GUI. |
| 2008 | Dynamic Algorithms A program written in C++ for offline and online versions of minimum spanning tree problem to experiment some known algorithms (Based on Sparsification Technique). (source code). Project Description Project Report |
| 2005 | Parallel Algorithms Quite a few parallel algorithms for some computational geometry problems with MPI. |
| 2004 | Theory of Computer Science An application for compiling and running the programs written in Primitive Recursive Languages with VB.NET and ASP.NET. |
| 2002 | Database An application for a staff department with VB.NET and SQL Server. |
| 2002 | Compilers A compiler for a language like Pascal with VC++. |
| 2002 | Artificial Intelligence and Robotics A Term Scheduling program with Prolog. |
| 2002 | Computer Simulation A program for a Moulding Factory with SLAM and AweSim. A program to simulate an elevator with SLAM and AweSim. |
| 2002 | Computerized Graphics A program for drawing some shapes with VC++ and OpenGL. |
| 2002 | Theory of Computation A program to simulate URM with VC++. |
| 2001 | Data Storage and Retrieval A program for storing files in pile structure with VC++. A program for storing sequential files with VC++. An application for a storage device with VC++. |
| 2001 | Principles of Computer Systems An Assembler/Debugger with Assembly language. |
| 2000 | Data Structures and Algorithms A program for drawing graphs using C++, as well as a lot of exercises. |