Google Analytics

Wednesday, February 17, 2010

Kurt Mehlhorn to receive EATCS award

Kurt Mehlhorn will receive EATCS award! Read about it here.

He has had a LONG and PRODUCTIVE career with many EXCELLENT papers. While he is mostly known for data structures and algorithms and Comp Geom, he did do some complexity theory early on. Here is a list of his papers up to 2007. Note that the first few are in complexity theory.

People in TCS can change fields easier than math since there is less background to learn. At least that was true at one time. I think it is harder to switch fields in Comp Sci now then it was then since now we know more.

5 comments:

  1. Kurt's matching papers starting in 1999 mark a new period in his work which could be called

    SHIFTS FOCUS TO GRAPH ALGORITHMS

    Congratulations to Kurt on an impressive career and well deserved award.

    ReplyDelete
  2. Kurt is amazing. Congrats Kurt!

    ReplyDelete
  3. Yes, he did some good research. I only wish I never went to work in his group.

    ReplyDelete
  4. Ask Kurt why this link is relevant to this post. He will know.

    http://www.nytimes.com/aponline/2010/02/19/us/AP-US-Laptops-Spying-on-Students.html

    ReplyDelete
  5. Why do storms sweep through western Europe? Because few of Europer are dishonest, God ask they pay for their cheating. Kurt should prove that the paper Algorithms to Compute Minimum Cycle Basis in Directed Graphs is original idea or not?

    ReplyDelete