A generic approach for the unranking of labeled combinatorial classes

DOI10.1002/rsa.10025zbMath0990.68094OpenAlexW1963510333WikidataQ56032705 ScholiaQ56032705MaRDI QIDQ2772928

Xavier Molinero, Conrado Martínez

Publication date: 19 February 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10025

zbMATH Keywords

unranking problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05)

Related Items (4)

Non-redundant random generation algorithms for weighted context-free grammars ⋮ Closure and nonclosure properties of the classes of compressible and rankable sets ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ Efficient iteration in admissible combinatorial classes

Cites Work

• Unnamed Item
• Conditional limit theorems for branching processes
• A calculus for the random generation of labelled combinatorial structures
• Computer algebra libraries for combinatorial structures
• On a probability problem connected with railway traffic
• Solution of a Divide-and-Conquer Maximin Recurrence
• A bernoulli excursion and its various applications
• On the Altitude of Nodes in Random Trees
• On Rotations and the Generation of Binary Trees

This page was built for publication: A generic approach for the unranking of labeled combinatorial classes