The following pages link to Patricio V. Poblete (Q818122):
Displaying 23 items.
- The binomial transform and the analysis of skip lists (Q818124) (← links)
- An O(m log log D) algorithm for shortest paths (Q1053460) (← links)
- Approximating functions by their Poisson transform (Q1108734) (← links)
- Average search and update costs in skip lists (Q1196460) (← links)
- A note on the height of the \(k\)th element in a heap (Q1314629) (← links)
- The analysis of heuristics for search trees (Q1323337) (← links)
- Transforming unbalanced multiway trees into a practical external data structure (Q1822941) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- (Q2741493) (← links)
- STRONGER QUICKHEAPS (Q3016226) (← links)
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme (Q3122915) (← links)
- (Q3330522) (← links)
- (Q3673089) (← links)
- The analysis of a fringe heuristic for binary search trees (Q3696534) (← links)
- Fault tolerance and storage reduction in binary search trees (Q3719842) (← links)
- (Q3796732) (← links)
- (Q3796733) (← links)
- (Q4035679) (← links)
- (Q4037402) (← links)
- Last-come-first-served hashing (Q4203805) (← links)
- The analysis of linear probing hashing with buckets (Q4595489) (← links)
- Permuting in Place (Q4834380) (← links)
- Analysis of the expected search cost in skip lists (Q5056100) (← links)
