Subject: Randomization and Algorithms
From: "William J. Rapaport" <rapaport@buffalo.edu>
Date: Tue, 6 Apr 2010 13:10:43 -0400 (EDT)

A few times this semester, the topic of randomization in algorithms has
come up. In a recent issue of the Communications of the ACM, there was
an interview with Michael Rabin, a winner of the Turing Award, that
discussed his work on that topic among others. The interview also has
interesting observations on the nature of computer science.

Rabin was my logic professor many years ago when I was a part-time
graduate student in math at NYU.

Shasha, Dennis (2010), "An Interview with Michael Rabin",
Communications of the ACM 53(2) (February): 37-42.
http://portal.acm.org.gate.lib.buffalo.edu/citation.cfm?id=1646353.1646369