@techreport{oai:ipsj.ixsq.nii.ac.jp:00032067,
 author = {大西建輔 and 星, 守 and Kensuke, Onishi and Mamoru, Hoshi},
 issue = {7(2000-AL-076)},
 month = {Jan},
 note = {点集合とその検索確率が与えられた場合に，検索路長の最適期待値を与える二分探索木を構成する問題を考える．本研究では，n点の点が与えられた場合に，どのような形状の木が最適であるかを，n次元離散確率分布を表現するn次元領域の分割をアレンジメントを用いて生成することにより任意の確率分布に対する最適木を与える., In this paper it is dealt with to find the best possible tree for searching table of keys with given probability. Our approach is that all binary search trees and its corresponding region of the parametric space of discrete probability distribution are constructed. In other words, for given n (number of set of points), we generate a subdivision of the parametric space of n-dimensional discrete probability distribution by hyperplane arrangement. Each region corresponds to a binary search tree and in the region such tree has optimal path length.},
 title = {検索確率をもつ二分探索木の探索長の最適期待値を与える領域分割の生成},
 year = {2001}
}