Archive for the ‘toc’ Category

Did you know this is the last day of CS Education Week? The creators of this event are highly engaged in bringing Computer Science to more high schools — in many states, CS is not given full consideration in the curriculum and this is shocking to me given that children are using computers not much later than […]

This week the University of Waterloo celebrated Bill Cunningham’s 65th birthday with a conference in his honour. Bill’s work is on graph matchings and matroids, specifically exact optimization, algorithms, and polyhedral combinatorics. For example, he gave the first polynomial-time algorithm to compute the strength of a graph. He completed his thesis at Waterloo under the […]



The diagram above is from a paper of mine which, as I found out today, was published last year! It is in ACM Transactions on Algorithms, although their website still lists the “current issue” as 2010 and they didn’t tell me when it went to press. The paper, joint with Ramki Thurimella, is about using a […]

Yesterday the annual International Collegiate Programming Contest (ICPC), sponsored by the Association for Computing Machinery (ACM), took place in Warsaw, Poland. This is a contest for three-person teams of university students. The team-oriented nature is wonderful, but also a historical artifact: when the first ICPC contest was run back in the 1970s, there were many more […]

Ravi Kannan gave a distinguished lecture today at Georgia Tech covering a wide swath of algorithms, randomness, and high-dimensional geometry. There was one particularly excellent slide that gave a very intuitive explanation for a result I have seen, but not fully understood, before. The result is in the field of streaming algorithms. Specifically, there is […]