• # BinaryTrees

• Referenced in 19 articles [sw14282]
• Pattern avoidance in binary trees. This paper considers the enumeration of trees avoiding a contiguous ... pattern. We provide an algorithm for computing the generating function that counts ... leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism ... tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous...
• # CAV

• Referenced in 9 articles [sw06910]
• Computational approaches to consecutive pattern avoidance in permutations In recent years, there has been increasing ... interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches ... counting permutations that avoid a set of prescribed patterns consecutively. These algorithms have been implemented ... approximate asymptotic constants for single pattern avoidance...
• # P123

• Referenced in 4 articles [sw19252]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. P123, to enumerate permutations containing exactly...
• # F123

• Referenced in 4 articles [sw19253]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. F123, Also to enumerate permutations containing exactly...
• # F1234

• Referenced in 4 articles [sw19254]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. F1234, Also to enumerate permutations containing exactly...
• # P1234

• Referenced in 4 articles [sw19255]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. P1234, to enumerate permutations containing exactly...
• # P12345

• Referenced in 4 articles [sw19256]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. P12345, to enumerate permutations containing exactly...
• # P123456

• Referenced in 4 articles [sw19257]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. P123456, to enumerate permutations containing exactly...
• # F12345

• Referenced in 4 articles [sw19258]
• given a pattern, or set of patterns, and you are asked to find a “formula ... outputs the number of permutations avoiding that pattern. F12345, Also to enumerate permutations containing exactly...
• # VATTER.txt

• Referenced in 1 article [sw19246]
• Counting Permutations that Avoid Many Patterns. This paper presents ... collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are ”many ... patterns to be avoided...
• # DPPA

• Referenced in 1 article [sw13587]
• Database of Permutation Pattern Avoidance (Look-Up). The aim of this database is to provide ... phenomena characterized by avoiding a finite number of permutation patterns...
• # SMS

• Referenced in 22 articles [sw01085]
• space. A new approach, implemented in SMS, avoids this problem by combining several techniques: symbolic ... formulas instead of a conventional pattern matching technique. SMS translates the derived symbolic formulas into...
• # FastSOA

• Referenced in 1 article [sw06301]
• right support of exciting new protocols and patterns, your SOA efforts can result in software ... organizations, or institutions avoid by using Frank Cohen’s FastSOA patterns, test methodology, and architecture...
• # UnQL

• Referenced in 9 articles [sw20018]
• simple and powerful query language based on pattern matching and show that ... down and remembers all its calls to avoid infinite loops, or as a bulk evaluation...