[Computational Complexity] My First Grand Student
- Today I am in Madison, Wisconsin where Scott Diehl has just defended his thesis. Scott's advisor, Dieter van Melkebeek, was my advisee at Chicago, making Scott my first Grand Student. I've waited a long time for a grand student, my first student Carsten Lund graduated back in 1991. But Carsten went to AT&T and my next student Lide Li also went into industry. But now with three students in academia (including Sophie Laplante at Paris-Sud and Rahul Santhanam going to Edinburgh), Scott will be the first of many.
Actually what I really want is an infinite tree below me, but König's lemma says I needed a grand student first.
Diehl's thesis is on time-space tradeoff's for satisfiability. I worked in this area about a decade ago then extended some of that work with Dieter who then worked on it with Scott, a passing of knowledge from generation to generation. The symbolism is so, umm, symbolic.
So as not to slight the other members of the family: Scott's academic aunt, my most recent student Varsha Dani, graduated last quarter. And just two days ago I was back at U. Chicago for Sourav Chakraborty's successful defense (Sourav is a student of Babai).
It's so nice to see the young ones grow up.
Posted By Lance to Computational Complexity at 4/17/2008 12:37:00 PM