www-new/content/tech-talks/the-best-algorithms-are-ran...

1.1 KiB

index title presentors thumbnails links
34 The Best Algorithms are Randomized Algorithms
Dr. Nick Harvey
small large
http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random-thumb-small.jpg http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random-thumb-large.jpg
file type
http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random.avi Talk (XviD)
file type
http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random.ogg Talk (Ogg/Theora)
file type
http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random.mp4 Talk (MP4)
file type
http://mirror.csclub.uwaterloo.ca/csclub/nick-harvey-random.mpg Talk (MPG)

For many problems, randomized algorithms are either the fastest algorithm or the simplest algorithm; sometimes they even provide the only known algorithm. Randomized algorithms have become so prevalent that deterministic algorithms could be viewed as a curious special case. In this talk I will describe some startling examples of randomized algorithms for solving some optimization problems on graphs.