The following pages link to Biased Search Trees (Q3685209):
Displaying 22 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Skip lift: a probabilistic alternative to red-black trees (Q450539) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Biased predecessor search (Q727976) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Efficient algorithms for computing Reeb graphs (Q924077) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Randomized search trees (Q1923861) (← links)
- Top tree compression of tries (Q2067669) (← links)
- A History of Distribution-Sensitive Data Structures (Q2848972) (← links)
- Skip Lift: A Probabilistic Alternative to Red-Black Trees (Q3000510) (← links)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees (Q3183458) (← links)
- Dynamic Tree Shortcut with Constant Degree (Q3196404) (← links)
- Confluently Persistent Tries for Efficient Version Control (Q3512456) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Near-entropy hotlink assignments (Q5961968) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
