A Short Tour of Randomized Techniques in Algorithm Design

When: Thursday, July 6, 2017
Where: PGH 563
Time: 11:00 AM – Noon

Speaker: Prof. Sandeep Sen, Indian Institute of Technology, Delhi

Host: Prof. Rakesh Verma

We will review some classical applications of random sampling techniques to
fundamental problems in algorithm design and combinatorics. We draw examples from diverse domains including graphs, geometry and algebra to illustrate the simplicity and versatility of these methods. Familiarity with basic undergraduate algorithms and probability will make the talk more accessible.

Bio:

Professor Sandeep Sen obtained his BTech in CS from IIT Kharagpur, MS from
UC Santa Barbara and PhD from Duke University in 1989. After a brief stint in 
Bell Labs, Murray Hill, he has been a faculty in IIT Delhi since 1991. He has held Visiting
positions in UNC Chapel Hill, University of Connecticut, MPI Saarbrucken, BRICS and MSR Bangalore and ISI Kolkata. His research interests span Algorithms and Complexity. Prof Sen is a Fellow of the Indian Academy of Sciences and the Indian National Science Academy. He is a former Head of Department of CSE and presently Dean Faculty in IIT Delhi.