Pages that link to "Item:Q2368931"
From MaRDI portal
The following pages link to Fast perfect sampling from linear extensions (Q2368931):
Displaying 21 items.
- Estimating the number of zero-one multi-way tables via sequential importance sampling (Q379986) (← links)
- Sequential importance sampling of binary sequences (Q746178) (← links)
- Generating a random linear extension of a partial order (Q805042) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Hook formulas for skew shapes. I: \(q\)-analogues and bijections (Q1679334) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures (Q2036791) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Entropic uniform sampling of linear extensions in series-parallel posets (Q2399366) (← links)
- Sorting under partial information (without the ellipsoid algorithm) (Q2439837) (← links)
- On random generation of fuzzy measures (Q2445561) (← links)
- Exact Sublinear Binomial Sampling (Q2872089) (← links)
- Sequence Covering Arrays and Linear Extensions (Q2946063) (← links)
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction (Q3191146) (← links)
- Generating Linear Extensions Fast (Q4291563) (← links)
- (Q5074777) (← links)
- Exact sublinear binomial sampling (Q5963375) (← links)
- A Sequential Importance Sampling Algorithm for Counting Linear Extensions (Q6039921) (← links)
