Computer Science | Grinnell College

On Thursday, October 30, Professor Sriram Pemmarju of the Department of Computer Science at the University of Iowa will discuss the uses of randomness in algorithm design:

Randomness has proven itself to be an amazingly useful resource in the design of simple and efficient algorithms. Randomized algorithms are now widespread in all areas of computer science; examples can be found in cryptography, data compression, distributed systems, machine learning, network protocols, online and streaming algorithms, etc. This talk will present a few “gems” of randomization—algorithms that highlight the elegance and power of randomized techniques, while identifying underlying principles that guide the design of randomized algorithms. Time permitting, the talk will also consider the theoretical question of whether randomness provably adds to the power of efficient algorithms.

Refreshments will be served at 4:15 p.m. in the Computer Science Commons (Noyce 3817). Professor Pemmarju's talk, “Toss a coin, throw a ball,and solve a problem,” will begin at 4:30 p.m. in Noyce 3821. Everyone is welcome to attend!

This week in Algorithmic Arts/CS Table (Friday, September 14, at noon, in Rosenfield 224A), we will read Matt Pearson's introduction to his book on generative art:

Pearson, Matt (2011). Introduction to Generative Art. Manning.

You can find the introduction online at http://www.manning.com/pearson/GenArt-Sample-Intro.pdf, and find out more about the book at http://www.manning.com/pearson/.

Adriana and Max will lead our discussion.

Remember that you can always find the readings list online at http://www.cs.grinnell.edu/~rebelsky/Courses/CSC295/2012F/Handouts/schedule.html.