scientific article
From MaRDI portal
Publication:2701738
zbMath0967.68173MaRDI QIDQ2701738
Publication date: 19 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Randomized algorithms (68W20)
Related Items (10)
An enumerative algorithm for \#2SAT ⋮ On Sampling Simple Paths in Planar Graphs According to Their Lengths ⋮ Path coupling using stopping times and counting independent sets and colorings in hypergraphs ⋮ Polynomial time approximate or perfect samplers for discretized Dirichlet distribution ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Path coupling without contraction ⋮ Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ On Computing the Total Displacement Number via Weighted Motzkin Paths ⋮ Polynomial time perfect sampling algorithm for two-rowed contingency tables
This page was built for publication:
