1. Micah Adler and Brent Heeringa . Approximating optimal binary decision trees. Algorithmica, 62(3--4):1112--1121 , 2012 . Micah Adler and Brent Heeringa. Approximating optimal binary decision trees. Algorithmica, 62(3--4):1112--1121, 2012.
2. Alok Aggarwal and Jeffrey Scott Vitter . The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116--1127 , 1988 . Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116--1127, 1988.
3. point location using persistent B-trees;Arge Lars;ACM Journal of Experimental Algorithmics,2003
4. Decision Trees for Geometric Models
5. Yosi Ben-Asher and Eitan Farchi . The cost of searching in general trees versus complete binary trees. Technical report , 1997 . Yosi Ben-Asher and Eitan Farchi. The cost of searching in general trees versus complete binary trees. Technical report, 1997.