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