@article{oai:u-ryukyu.repo.nii.ac.jp:02001997,
 author = {Nakao, Zensho and Takeuchi, Kazuo and Yogi, Takashi and 仲尾, 善勝},
 issue = {38},
 journal = {琉球大学工学部紀要},
 note = {Two new methods for parallel tree traverse are given, and their implementations are described and tested in Ada which supports parallel programming via Ada tasks. The simulations performed show that (1) when there are no restriction imposed on the number of Ada tasks, the amount of time required for the traverse remains constant (equaling a number related to the height of the tree) for varying number of tree nodes; (2) in case where a pre-assigned number of tasks are used, the traverse time varies inversely as the number of tasks., 紀要論文},
 pages = {67--82},
 title = {On Parallel Tree Traverse in Ada}
}