Constant-memory iterative generation of special strings representing binary trees (Q2909202)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constant-memory iterative generation of special strings representing binary trees |
scientific article; zbMATH DE number 6073949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-memory iterative generation of special strings representing binary trees |
scientific article; zbMATH DE number 6073949 |
Statements
30 August 2012
0 references
tree permutations
0 references
stack-sortable permutations
0 references
231-avoiding permutations
0 references
enumeration of binary trees
0 references
0.8650948
0 references
0.8521629
0 references
0.8508752
0 references
0.8477538
0 references
0.8456693
0 references
0.84413975
0 references
0.84407425
0 references
Constant-memory iterative generation of special strings representing binary trees (English)
0 references
