The following pages link to (Q4178385):
Displaying 44 items.
- On the complexity of binary floating point pseudorandom generation (Q293511) (← links)
- On secret set schemes (Q294774) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Model-based testing of probabilistic systems (Q682363) (← links)
- Preserving the number of cycles of length \(k\) in a growing uniform permutation (Q727199) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- Binary decompositions of probability densities and random-bit simulation (Q777909) (← links)
- Finitely dependent processes are finitary (Q782416) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Formalization of the standard uniform random variable (Q995466) (← links)
- Efficient simulations by a biased coin (Q1352086) (← links)
- Bit-parallel random number generation for discrete uniform distributions (Q1605121) (← links)
- Stochastic and quasistochastic computations (Q1759522) (← links)
- Fast simulation of new coins from old (Q1774211) (← links)
- Algebras of probability distributions on finite sets (Q1798085) (← links)
- A ramp model for distributed key distribution schemes (Q1811091) (← links)
- Sharp entropy bounds for discrete statistical simulation (Q1962169) (← links)
- Asymptotic complexity of Monte Carlo methods for solving linear systems (Q1973275) (← links)
- From biased coin to any discrete distribution (Q2043731) (← links)
- Model checking hyperproperties for Markov decision processes (Q2105474) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- The expected bit complexity of the von Neumann rejection algorithm (Q2361447) (← links)
- Efficient sampling methods for discrete distributions (Q2408923) (← links)
- Unconditionally secure key assignment schemes (Q2489918) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling (Q2701491) (← links)
- Sampling Exactly from the Normal Distribution (Q2828164) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- Complexity Questions in Non-Uniform Random Variate Generation (Q3298440) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- Universal finitary codes with exponential tails (Q3434058) (← links)
- Randomness in distribution protocols (Q4632457) (← links)
- On the number of random bits in totally private computation (Q4645176) (← links)
- Multiple ramp schemes (Q4701443) (← links)
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models (Q4991932) (← links)
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite (Q5056039) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- (Q5111641) (← links)
- Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (Q5366902) (← links)
- Randomness extraction in computability theory (Q5880936) (← links)
