Parallel generation of binary trees in A-order-Reference-Cited by-同舟云学术

Parallel generation of binary trees in A-order

Published:2005-08 Issue:8-9 Volume:31 Page:948-955
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Ahrabian Hayedeh,Nowzari-Dalini Abbas

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference16 articles.

1. On the generation of binary trees in A-order;Ahrabian;Int. J. Comput. Math.,1999

2. The Design and Analysis of Parallel Algorithms;Akl,1989

3. An optimal systolic algorithm for generating permutation in lexicographic order;Akl;J. Parallel Distr. Com.,1994

4. Generating t-ary trees in parallel;Akl;Nord. J. Com.,1996

5. Efficient generation of k-ary trees in natural order;Er;Comput. J.,1992

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees;AKCE International Journal of Graphs and Combinatorics;2018-04-01

2. Generation, Ranking and Unranking of Ordered Trees with Degree Bounds;Electronic Proceedings in Theoretical Computer Science;2016-03-02

3. Ranking and unranking algorithms for loopless generation of t-ary trees;Logic Journal of IGPL;2010-07-03

4. Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences;Information and Communication Technologies;2010

5. The Research on Parallel Algorithm of A-order in Binary Tree Based on PRAM Model;2009 First International Workshop on Education Technology and Computer Science;2009