In celebration of IMSc's 50th year, the theoretical computer science group arranged thematic lectures aimed at college teachers and students, one Saturday every month.
The first of these was on March 17th, 2012, on the theme Aha! Divide and Conquer.
The second of these was on April 21st, 2012, on the theme Randomization in Computer Science.
The third of these was on May 19th, 2012, on the theme Graphs: Explorations and Algorithms.
The fourth of these was on June 23rd, 2012, on the theme Concurrency in the Multicore Age.
The fifth of these was on July 21st, 2012, on the theme Automata in the Real World.
The sixth of these was on August 25th, 2012, on the theme A Celebration of Turing.
The seventh of these was on September 15th, 2012, on the theme Matchings in graphs.
The eighth of these was on October 20th, 2012, on the theme Computational geometry: Searching for a nearest neighbor.
The ninth of these was on November 24th, 2012, on the theme Matroids and algorithms.
The tenth of these was on December 22nd, 2012, on the theme Network flows.