Results 1  10
of
75,408
Adaptive Generation of tary Trees in Parallel 1
"... In this paper, a new adaptive and costoptimal parallel algorithm is presented for generating tary tree sequences in reverse Border. The algorithm generates tary trees by zsequences in lexicographical order. Computations run in an EREW SM SIMD model. Prior to the discussion of the parallel algor ..."
Abstract
 Add to MetaCart
In this paper, a new adaptive and costoptimal parallel algorithm is presented for generating tary tree sequences in reverse Border. The algorithm generates tary trees by zsequences in lexicographical order. Computations run in an EREW SM SIMD model. Prior to the discussion of the parallel
Parallel Generation Of tary Trees in Aorder
, 2007
"... We present a costoptimal and adaptive parallel algorithm for generating tary trees in Aorder. The generation is based on an encoding using integer sequences (zsequences) due to Zaks [(1980), Lexicographic generation of ordered tree. Theor. Comput. Sci., 10, 63–82]. Our algorithm is the first int ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a costoptimal and adaptive parallel algorithm for generating tary trees in Aorder. The generation is based on an encoding using integer sequences (zsequences) due to Zaks [(1980), Lexicographic generation of ordered tree. Theor. Comput. Sci., 10, 63–82]. Our algorithm is the first
On Parallel Generation of tary Trees in an Associative Model
 PPAM 2001, Lecture Notes in Computer Science 2328
, 2002
"... In this paper a new parallel algorithm is presented for generation of tary trees. Computations run in an associative processor model. ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
In this paper a new parallel algorithm is presented for generation of tary trees. Computations run in an associative processor model.
Parallel Enumeration of t–ary Trees in ASC SIMD Model
"... In this paper parallel algorithms are presented for enumeration and unranking of t–ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC that belongs to a broad category of SIMD models. Tree sequences are generated in lexicographical order, with O ..."
Abstract
 Add to MetaCart
In this paper parallel algorithms are presented for enumeration and unranking of t–ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC that belongs to a broad category of SIMD models. Tree sequences are generated in lexicographical order
University of Tehran, ISSN 10161104 Parallel Generation of tary Trees
"... A parallel algorithm for generating tary tree sequences in reverse Border is presented. The algorithm generates tary trees by 01 sequences, and each 01 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and costoptimal. Prio ..."
Abstract
 Add to MetaCart
A parallel algorithm for generating tary tree sequences in reverse Border is presented. The algorithm generates tary trees by 01 sequences, and each 01 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost
The register function for tary trees
 ACM Trans. Algorithms
"... Abstract. For the register function for t–ary trees, recently introduced by Auber et al., we prove that the average is log4 n+O(1), if all such trees with n internal nodes are considered to be equally likely. This result remains true for rooted trees where the set of possible out–degrees is finite. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. For the register function for t–ary trees, recently introduced by Auber et al., we prove that the average is log4 n+O(1), if all such trees with n internal nodes are considered to be equally likely. This result remains true for rooted trees where the set of possible out–degrees is finite
Lexicographic Listing and Ranking of rary Trees
, 1985
"... This paper presents three simple and efficient algorithms for generating, ranking and unranking tary trees in a lexicographic order. The simplest idea of encoding a tary tree with n nodes as a bitstring of length t*n is exploited to its full advantages. It is proved that the lexicographic order i ..."
Abstract
 Add to MetaCart
This paper presents three simple and efficient algorithms for generating, ranking and unranking tary trees in a lexicographic order. The simplest idea of encoding a tary tree with n nodes as a bitstring of length t*n is exploited to its full advantages. It is proved that the lexicographic order
An Efficient Ranking Algorithm of tary Trees in Graycode Order
 THE 29TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... A tary tree is a rooted tree such that every internal node has exactly t disjoint subtrees. Recently, a concise representation called RDsequences was introduced to represent tary trees and their generalization called nonregular trees. In particular, a loopless algorithm has been proposed by Wu e ..."
Abstract
 Add to MetaCart
et al. (2010) for generating nonregular trees (and thus of tary trees) encoded by RDsequences in a Graycode order. In this paper, based on such a Graycode order, we present efficient ranking algorithm of tary trees with n internal nodes. The time complexity and space requirement in the algorithm
Ranking and Unranking tary Trees in a GrayCode Order
, 2012
"... A tary tree is a rooted tree such that every internal node has exactly t disjoint subtrees. Recently, a concise representation called rightdistance sequences (RDsequences) was introduced to represent tary trees and their generalization called nonregular trees. In particular, a loopless algorith ..."
Abstract
 Add to MetaCart
algorithm has been proposed by Wu et al. ((2010) Loopless generation of nonregular trees with a prescribed branching sequence. Comput. J., 53, 661–666) for generating nonregular trees (and thus of tary trees) encoded by RDsequences in a Graycode order. In this paper, based on such a Graycode order, we
Results 1  10
of
75,408