Randomized algorithms and pseudorandom numbers
From MaRDI portal
Recommendations
Cited in
(19)- Random access to a random number sequence
- Primality testing with fewer random bits
- Improved algorithms via approximations of probability distributions
- Randomized geometric algorithms and pseudorandom generators
- Quasi-random rumor spreading: reducing randomness can be costly
- Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing
- Separation of random number generation and resolvability
- A time-randomness tradeoff for quasi-random rumour spreading
- Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms
- Quicksort, largest bucket, and min-wise hashing with limited independence
- scientific article; zbMATH DE number 4072216 (Why is no real title available?)
- Arithmetic modeling of random processes and \(r\)-algorithms
- scientific article; zbMATH DE number 17389 (Why is no real title available?)
- The Monte Carlo Algorithm with a Pseudorandom Generator
- scientific article; zbMATH DE number 1512196 (Why is no real title available?)
- scientific article; zbMATH DE number 4113619 (Why is no real title available?)
- Interval Algorithm for Random Number Generation: Information Spectrum Approach
- Improved parallel approximation of a class of integer programming problems
- Golden ratio versus pi as random sequence sources for Monte Carlo integration
This page was built for publication: Randomized algorithms and pseudorandom numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140013)