The following pages link to Pooya Davoodi (Q262261):
Displaying 14 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures (Q2849313) (← links)
- Two-Dimensional Range Diameter Queries (Q2894467) (← links)
- Two Dimensional Range Minimum Queries and Fibonacci Lattices (Q2912843) (← links)
- Succinct Representations of Binary Trees for Range Minimum Queries (Q2914344) (← links)
- Cache-Oblivious Persistence (Q2921414) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Encoding range minima and range top-2 queries (Q2955625) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- On Space Efficient Two Dimensional Range Minimum Data Structures (Q3586393) (← links)
- Path Minima Queries in Dynamic Weighted Trees (Q5199250) (← links)
