|
|
|
|
Parallel Generation of t-ary Trees.
|
|
|
|
|
|
|
|
نویسنده
|
Ahrabian H. ,Nowzari-Dalini A.
|
|
منبع
|
journal of sciences islamic republic of iran - 2005 - دوره : 16 - شماره : 2 - صفحه:169 -173
|
|
چکیده
|
A parallel algorithm for generating t-ary tree sequences in reverse b-order is presented. the algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time o(1). the algorithm is executed on a crew sm simd model, and is adaptive and cost-optimal. prior to the discussion of the parallel algorithm a new sequential generation with o(1) average time complexity, and ranking and unranking algorithms with o(t n) time complexity is also given.
|
|
کلیدواژه
|
t-ary Trees; Parallel algorithm; B-order; 0-1 Sequences; Recursion.
|
|
آدرس
|
university of tehran, Faculty of Sciences , Department of Mathematics and Computer Science , ایران, university of tehran, Faculty of Sciences , Department of Mathematics and Computer Science , ایران
|
|
پست الکترونیکی
|
ahrabian@ut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|