Generating binary trees with uniform probability (Q751300): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A numbering system for binary trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for tree reconstruction / rank | |||
Normal rank | |||
Latest revision as of 12:49, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating binary trees with uniform probability |
scientific article |
Statements
Generating binary trees with uniform probability (English)
0 references
1991
0 references
enumeration
0 references
Bernoulli polynomials
0 references
Catalan numbers
0 references
binary tree
0 references
Markov chain
0 references
