In an undergraduate algorithms class we learn that an algorithm is a high level way to describe a computer program. The running time of the algorithm is the number of operations it takes on inputs of a particular size- the smaller the better. So, as even Barack Obama knows, if you implement Quick-Sort, with its … Continue reading Erdős’s Book and the Asymptotic Religion
Month: January 2015
FOCS 2014 videos are online
And available at this web page. At some point I would like to add a direct link to the video for each paper from the program page, but I figured that it's best to announce this now rather than let the perfect be the enemy of the good. Update: Paul Beame notes below that the videos, as … Continue reading FOCS 2014 videos are online