CSTA K-12 Repository: Item 2378/375

	Home

Browse
	Communities & Collections
	Titles
	Authors
	By Date

Sign on to:
	My Account CSTA members
	Receive email updates
	Edit Profile



	About DSpace

CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 3: Computer Science as Analysis and Design >
L3 A: Topics >
L3 A 03: Discrete Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2378/375

Title:	Power of Randomness in Computation
Authors:	Zuckerman, David
Keywords:	randomness use of randomness simulation random sampling Monte Carlo simulations cryptography random number generator
Issue Date:	Jul-2008
Publisher:	U Texas-Austin
Abstract:	The presenter talks about the usefulness of randomness in CS noting algorithms, Monte Carlo simulations, cryptography. He explores the generation of pseudo-random numbers and the quality of random numbers generated including the minimal randomness requirement.
URI:	http://hdl.handle.net/2378/375
Appears in Collections:	L3 A 03: Discrete Mathematics L4 B 10: Programming Simulations L4 A 05: Standard Algorithms [AP Topic Outline V] L3 C 03: Societal issues in software engineering, limits of computing, levels of languages, computing careers L3 A 07: Limits of computing

Files in This Item:

File	Description	Size	Format
Power_of_Randomness.ppt		204Kb	Microsoft Powerpoint	View/Open

All items in DSpace are protected by copyright, with all rights reserved.

DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard

or broken NS 4.x --%>