Pages that link to "Item:Q1235007"

The following pages link to Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees (Q1235007):

Displayed 11 items.

• An improved algorithm for the maximum agreement subtree problem (Q1041753) ‎ (← links)
• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) ‎ (← links)
• The extendible cell method for closest point problems (Q1161290) ‎ (← links)
• Average case analysis of region search in balanced k-d trees (Q1253931) ‎ (← links)
• Dynamic orthogonal range queries in OLAP. (Q1401285) ‎ (← links)
• An algorithm for handling many relational calculus queries efficiently. (Q1872707) ‎ (← links)
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) ‎ (← links)
• Information storage and search complexity theory (Q2453382) ‎ (← links)
• Chaining algorithms for multiple genome comparison (Q2569405) ‎ (← links)
• An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) ‎ (← links)
• Optimal binary search trees (Q5906917) ‎ (← links)