Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964329821 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.1140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of a Motzkin word / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the generation of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random generation of underdiagonal walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Buffon Machines and Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GFUN / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank

Latest revision as of 10:12, 14 July 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
    0 references
    0 references
    0 references
    13 September 2017
    0 references
    0 references
    random sampling
    0 references
    Remy algorithm
    0 references
    holonomic equation
    0 references
    plane trees
    0 references
    0 references
    0 references