scientific article; zbMATH DE number 3614066

Andrew Chi-Chih Yao, Donald E. Knuth

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Computational Random Number Generation Exponential Distribution Complexity and Efficiency of Algorithms Distribution Generating Tree Polynomial Distributions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Random number generation in numerical analysis (65C10) Distribution theory (60E99)

Related Items

Randomness extraction in computability theory, The expected bit complexity of the von Neumann rejection algorithm, On the complexity of binary floating point pseudorandom generation, On secret set schemes, Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite, Efficient simulations by a biased coin, Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography, The complexity of reachability in parametric Markov decision processes, CryptHOL: game-based proofs in higher-order logic, Efficient sampling methods for discrete distributions, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, 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, Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example, Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling, Sharp entropy bounds for discrete statistical simulation, Asymptotic complexity of Monte Carlo methods for solving linear systems, Complexity Questions in Non-Uniform Random Variate Generation, Sequential Convex Programming for the Efficient Verification of Parametric MDPs, Fully dynamic secret sharing schemes, On the information rate of secret sharing schemes, On the number of random bits in totally private computation, Model-based testing of probabilistic systems, Stochastic and quasistochastic computations, Unconditionally secure key assignment schemes, Fast simulation of new coins from old, Formalization of the standard uniform random variable, Preserving the number of cycles of length \(k\) in a growing uniform permutation, Algebras of probability distributions on finite sets, From biased coin to any discrete distribution, Multiple ramp schemes, Unnamed Item, Sampling from discrete Gaussians for lattice-based cryptography on a constrained device, A ramp model for distributed key distribution schemes, Sampling Exactly from the Normal Distribution, A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models, Binary decompositions of probability densities and random-bit simulation, Finitely dependent processes are finitary, Random sampling of contingency tables via probabilistic divide-and-conquer, Universal finitary codes with exponential tails, Model checking hyperproperties for Markov decision processes, Bit-parallel random number generation for discrete uniform distributions, Randomness in distribution protocols, Random Generation for Finitely Ambiguous Context-free Languages, On efficient randomized algorithms for finding the PageRank vector