On iteration in discrete probabilistic programming
From MaRDI portal
Cites work
- A logic for reasoning about time and reliability
- Cantor meets Scott: semantic foundations for probabilistic networks
- Characterization of cutoff for reversible Markov chains
- Commutative semantics for probabilistic programming
- Does a Program Yield the Right Distribution?
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Matrix Analysis
- On application of multi-rooted binary decision diagrams to probabilistic model checking
- On probabilistic inference by weighted model counting
- On the hardness of approximate reasoning
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Probabilistic inference by program transformation in Hakaru (system description)
- Probabilistic NetKAT
- Probabilistic relational verification for cryptographic implementations
- Semantics of Probabilistic Programming: A Gentle Introduction
- Semantics of probabilistic programs
- The cutoff phenomenon in finite Markov chains.
- The Markov chain Monte Carlo revolution
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
This page was built for publication: On iteration in discrete probabilistic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874992)
