Pages that link to "Item:Q1840511"

The following pages link to Partial match queries in relaxed multidimensional search trees (Q1840511):

Displaying 19 items.

• On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
• A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
• Partial match retrieval in implicit data structures (Q800083) (← links)
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
• Weighted height of random trees (Q934911) (← links)
• Choosing optimal branching factors for k-d-B trees (Q1058876) (← links)
• Limit laws for partial match queries in quadtrees (Q1872463) (← links)
• Reductions in binary search trees (Q2369002) (← links)
• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees (Q2789547) (← links)
• Psi-series method for equality of random trees and quadratic convolution recurrences (Q2874083) (← links)
• Selection by rank in K-dimensional binary search trees (Q2877767) (← links)
• Multidimensional extendible hashing for partial-match queries (Q3750158) (← links)
• Multidimensional digital searching—alternative data structures (Q4288883) (← links)
• (Q4471382) (← links)
• Partial Match Queries in Random Quadtrees (Q4706238) (← links)
• The variance of a partial match retrieval in a multidimensional symmetric trie (Q4847397) (← links)
• Partial match queries in random quadtrees (Q5743457) (← links)
• Interview with Helmut Prodinger (Q6097080) (← links)
• On the expected cost of partial match queries in random quad-\(K\)-d trees (Q6130360) (← links)