The following pages link to (Q2701738):
Displaying 19 items.
- An enumerative algorithm for \#2SAT (Q283678) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← links)
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables (Q703540) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- A method for obtaining randomized algorithms with small tail probabilities (Q1923864) (← links)
- Path coupling without contraction (Q2457299) (← links)
- On \(O(1)\) time algorithms for combinatorial generation (Q2765228) (← links)
- On Computing the Total Displacement Number via Weighted Motzkin Paths (Q2819524) (← links)
- On Sampling Simple Paths in Planar Graphs According to Their Lengths (Q2946419) (← links)
- Polynomial time perfect sampling algorithm for two-rowed contingency tables (Q3419592) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (Q4016895) (← links)
- Genericity, Randomness, and Polynomial-Time Approximations (Q4210154) (← links)
- (Q4395335) (← links)
- Algorithms - ESA 2003 (Q5897289) (← links)
- Generating a random sink-free orientation in quadratic time (Q5960785) (← links)
- On randomized sketching algorithms and the Tracy-Widom law (Q6163409) (← links)
