Computing downwards accumulations on trees quickly

Downwards passes on binary trees are essentially functions which pass information down a tree, from the root towards the leaves. Under certain conditions, a downwards pass is both 'efficient' (computable in a functional style in parallel time proportional to the depth of the tree) and ...

全面介紹

書目詳細資料
主要作者: Gibbons, J
格式: Journal article
語言:English
出版: 1996