Skip navigation
Skip navigation

Uses of randomness in computation

Brent, Richard P


Random number generators are widely used in practical algorithms. Examples include simulation, number theory (primality testing and integer factorization), fault tolerance, routing, cryptography, optimization by simulated annealing, and perfect hashing. Complexity theory usually considers the worst-case behaviour of deterministic algorithms, but it can also consider average-case behaviour if it is assumed that the input data is drawn randomly from a given distribution. Rabin popularised the...[Show more]

CollectionsANU Research Publications
Date published: 1994
Type: Working/Technical Paper


File Description SizeFormat Image
1622-01.2003-07-09T01:22:44Z.xsh356 BEPrints MD5 Hash XML
TR-CS-94-06.pdf221.47 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator