scientific article; zbMATH DE number 3614066
From MaRDI portal
Publication:4178385
zbMATH Open0395.65004MaRDI QIDQ4178385FDOQ4178385
Authors: Donald E. Knuth, Andrew Chi-Chih Yao 
Publication date: 1976
Title of this publication is not available (Why is that?)
ComputationalExponential DistributionRandom Number GenerationComplexity and Efficiency of AlgorithmsDistribution Generating TreePolynomial Distributions
Random number generation in numerical analysis (65C10) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distribution theory (60E99)
Cited In (48)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- Fast simulation of new coins from old
- The expected bit complexity of the von Neumann rejection algorithm
- Model-based testing of probabilistic systems
- Model checking hyperproperties for Markov decision processes
- Bit-parallel random number generation for discrete uniform distributions
- The complexity of reachability in parametric Markov decision processes
- Tight bounds on the randomness complexity of secure multiparty computation
- Extraction rates of random continuous functionals
- Efficient sampling methods for discrete distributions
- Complexity Questions in Non-Uniform Random Variate Generation
- Random sampling of contingency tables via probabilistic divide-and-conquer
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
- On the complexity of binary floating point pseudorandom generation
- On secret set schemes
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Formalization of the standard uniform random variable
- Stochastic and quasistochastic computations
- On efficient randomized algorithms for finding the PageRank vector
- On the information rate of secret sharing schemes
- Preserving the number of cycles of length \(k\) in a growing uniform permutation
- Fully dynamic secret sharing schemes
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- CryptHOL: game-based proofs in higher-order logic
- Unconditionally secure key assignment schemes
- Sequential convex programming for the efficient verification of parametric MDPs
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- On the number of random bits in totally private computation
- 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
- Asymptotic complexity of Monte Carlo methods for solving linear systems
- Random Generation for Finitely Ambiguous Context-free Languages
- A ramp model for distributed key distribution schemes
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Sharp entropy bounds for discrete statistical simulation
- Binary decompositions of probability densities and random-bit simulation
- Randomness extraction in computability theory
- Finitely dependent processes are finitary
- QMaude: quantitative specification and verification in rewriting logic
- Efficient simulations by a biased coin
- Universal finitary codes with exponential tails
- From biased coin to any discrete distribution
- Parameter synthesis in Markov models: a gentle survey
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- Randomness in distribution protocols
- Algebras of probability distributions on finite sets
- Multiple ramp schemes
- Sampling exactly from the normal distribution
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)
