scientific article; zbMATH DE number 3614066
From MaRDI portal
Publication:4178385
Cited in
(53)- Efficient simulations by a biased coin
- Bit-parallel random number generation for discrete uniform distributions
- Stochastic and quasistochastic computations
- Fast simulation of new coins from old
- Algebras of probability distributions on finite sets
- A ramp model for distributed key distribution schemes
- Sharp entropy bounds for discrete statistical simulation
- Asymptotic complexity of Monte Carlo methods for solving linear systems
- From biased coin to any discrete distribution
- Model checking hyperproperties for Markov decision processes
- CryptHOL: game-based proofs in higher-order logic
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- On efficient randomized algorithms for finding the PageRank vector
- The expected bit complexity of the von Neumann rejection algorithm
- Efficient sampling methods for discrete distributions
- Unconditionally secure key assignment schemes
- The complexity of reachability in parametric Markov decision processes
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- Sampling exactly from the normal distribution
- On the complexity of binary floating point pseudorandom generation
- On secret set schemes
- Random Generation for Finitely Ambiguous Context-free Languages
- Complexity Questions in Non-Uniform Random Variate Generation
- Sequential convex programming for the efficient verification of parametric MDPs
- Universal finitary codes with exponential tails
- Randomness in distribution protocols
- On the number of random bits in totally private computation
- Multiple ramp schemes
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- Randomness extraction in computability theory
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Parameter synthesis in Markov models: a gentle survey
- Extraction rates of random continuous functionals
- Tight bounds on the randomness complexity of secure multiparty computation
- QMaude: quantitative specification and verification in rewriting logic
- Fully dynamic secret sharing schemes
- On the information rate of secret sharing schemes
- Model-based testing of probabilistic systems
- Minimum cut in O(m^2 n time
- On iteration in discrete probabilistic programming
- Optimal random bit complexity in efficient sampling of set partition-like structures
- Playing repeated games with sublinear randomness
- Preserving the number of cycles of length k in a growing uniform permutation
- Explainability is a game for probabilistic bisimilarity distances
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Binary decompositions of probability densities and random-bit simulation
- Finitely dependent processes are finitary
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Formalization of the standard uniform random variable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178385)
