Pages that link to "Item:Q3140013"

The following pages link to Randomized algorithms and pseudorandom numbers (Q3140013):

Displaying 19 items.

• Arithmetic modeling of random processes and \(r\)-algorithms (Q380647) (← links)
• Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
• Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
• Random access to a random number sequence (Q1184612) (← links)
• Primality testing with fewer random bits (Q1321031) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
• Quasi-random rumor spreading: reducing randomness can be costly (Q1944078) (← links)
• Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing (Q2513347) (← links)
• Separation of random number generation and resolvability (Q2705953) (← links)
• A time-randomness tradeoff for quasi-random rumour spreading (Q2851485) (← links)
• Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms (Q3301012) (← links)
• Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
• (Q3804062) (← links)
• (Q3974094) (← links)
• The Monte Carlo Algorithm with a Pseudorandom Generator (Q3987938) (← links)
• (Q4505841) (← links)
• (Q4729071) (← links)
• Interval Algorithm for Random Number Generation: Information Spectrum Approach (Q5123813) (← links)