default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPooya Davoodi
Person information
- affiliation: New York University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Pooya Davoodi, Rajeev Raman
, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. Math. Comput. Sci. 11(2): 177-189 (2017)- 2016
- [j3]Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti:
Succinct Dynamic Cardinal Trees. Algorithmica 74(2): 742-777 (2016) - [j2]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti:
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) - 2015
- [c9]Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
Range Minimum Query Indexes in Higher Dimensions. CPM 2015: 149-159 - 2014
- [c8]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. ESA 2014: 296-308 - [i3]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. CoRR abs/1402.5492 (2014) - [i2]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. CoRR abs/1410.4963 (2014) - 2013
- [c7]Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi:
The Encoding Complexity of Two Dimensional Range Minimum Data Structures. ESA 2013: 229-240 - [i1]Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Encoding Range Minimum Queries. CoRR abs/1311.4394 (2013) - 2012
- [j1]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63(4): 815-830 (2012) - [c6]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
Succinct Representations of Binary Trees for Range Minimum Queries. COCOON 2012: 396-407 - [c5]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao:
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228 - [c4]Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen:
Two-Dimensional Range Diameter Queries. LATIN 2012: 219-230 - 2011
- [c3]Pooya Davoodi, S. Srinivasa Rao:
Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. TAMC 2011: 195-205 - [c2]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
Path Minima Queries in Dynamic Weighted Trees. WADS 2011: 290-301 - 2010
- [c1]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. ESA (2) 2010: 171-182
Coauthor Index
aka: Srinivasa Rao Satti
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
