“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 10766 | ||||||||||||||||||||||||||
|
||||||||||||||||||||||||||
| Abstract: | ||||||||||||||||||||||||||
|
We present a new parallel algorithm for generating binary trees; it generates trees in A-order using A-sequences representation. This algorithm is adaptive and cost-optimal and is executed on a shared memory multiprocessor. We know of no other parallel algorithm in the literature that generates trees in A-order. This parallel algorithm is designed based on a presented sequential generation algorithm for A-sequences, with O(1) average time complexity.
Download TeX format |
||||||||||||||||||||||||||
| back to top | ||||||||||||||||||||||||||
