Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: gfun / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964329821 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1401.1140 / rank | |||
Normal rank | |||
Revision as of 06:26, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient random sampling of binary and unary-binary trees via holonomic equations |
scientific article |
Statements
Efficient random sampling of binary and unary-binary trees via holonomic equations (English)
0 references
13 September 2017
0 references
random sampling
0 references
Remy algorithm
0 references
holonomic equation
0 references
plane trees
0 references
