1 citations · 1 across the 3 of their papers we have counts for
3 papers
On Succinct Representations of Binary Trees
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
We observe that a standard transformation between \emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree rep…
Cache-Oblivious Persistence
Pooya Davoodi, Jeremy T. Fineman, John Iacono +1
Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the l…
Encoding Range Minimum Queries
Pooya Davoodi, Gonzalo Navarro, Rajeev Raman +1
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can a…