Swarthmore College Department of Computer Science

Talk by Aravind Srinivasan

An Invitation to Randomized Algorithms
Tuesday, November 8
SCI 240, 4:00 pm

Abstract

Randomized algorithms, where an algorithm makes random choices as it runs, have emerged as a powerful paradigm in computer science. I will survey a few useful applications of randomized algorithms, in the contexts of distributed computing, networks, processing massive data streams, etc. We will also try to understand the broad paradigms that make such algorithms work. The talk will not assume a background in the area, and is meant as an invitation to the field.