Binary Search Trees
March 8, 2013
12:00 n - 1:00 pm
Halligan 111B
Speaker: Joshua Brody, Aarhus University
Host: Donna Slonim
Abstract
Lecturer candidate Joshua Brody received his PhD from Dartmouth in theoretical computer science (focusing on communication complexity). After working with Andy Yao at Tsinghua University, he is now a postdoctoral researcher at Aarhus University with Peter Bro Miltersen.
He will be giving a sample comp 15 lecture covering binary search trees.