Pages that link to "Item:Q1236548"
From MaRDI portal
The following pages link to A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects (Q1236548):
Displayed 14 items.
- Generating alternating permutations lexicographically (Q583885) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- Inductive and injective proofs of log concavity results (Q1111553) (← links)
- A lattice walk approach to the ''inv'' and ''maj'' q-counting of multiset permutations (Q1142214) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- Inductive proofs of \(q\)-log concavity (Q1191957) (← links)
- Enumeration des tableaux Standards (Q1255494) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Uniform random generation of words of rational languages (Q1351211) (← links)
- Watermelon uniform random generation with applications (Q1885015) (← links)
- Random and uniform generation of words (Q1917516) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- On the log-convexity of combinatorial sequences (Q2467343) (← links)
- Combinatorial identities by way of Wilf's multigraph model (Q2644160) (← links)