Golden Jubilee Thematic Lectures in Theoretical Computer Science

In celebration of IMSc's 50th year, the theoretical computer science group is planning to have thematic lectures aimed at college teachers and students, one Saturday every month.

The topic for November is Matroids and algorithms and is scheduled for November 24, 2012 at Alladi Ramakrishnan Hall, IMSc. All are welcome.



Time Title Speaker
10:00 - 11:15
What are matroids ?
  		Saket Saurabh, IMSc
11:15 - 11:45 Tea/Coffee Break
11:45 - 13:00
Algorithm for matroid intersection: Augmentation to intersection
  		Manu Basavaraju, IMSc
13:00 - 14:00 Lunch
14:00 - 15:15
Algorithms using matroids
 		 Saket Saurabh, Fahad Panolan and Pranabendu Misra, IMSc
15:15 - 15:45 Tea/Coffee Break



Earlier thematic Lectures
The first of these was on Saturday, March 17th on the theme Aha! Divide and Conquer.
The second of these was on Saturday, April 21st on the theme Randomization in Computer Science.
The third of these was on Saturday, May 19th on the theme Graphs: Explorations and Algorithms.
The fourth of these was on Saturday, June 23rd on the theme Concurrency in the Multicore Age.
The fifth of these was on Saturday, July 21st on the theme Automata in the Real World.
The sixth of these was on Saturday, August 25th on the theme A Celebration of Turing.
The seventh of these was on Saturday, September 15th on the theme Matchings in graphs.
The eighth of these was on Saturday, October 20th on the theme Computational geometry: Searching for a nearest neighbor.