The search tree is one of the most basic and most important data structures in computer science. It lies behind all modern database systems and has many other applications. Although the history of this data structure extends back more than fifty years, we still do not know everything about it. This talk will explore new ideas that lead both to simpler kinds of search trees and to a better analysis of their efficiency.
When: Tuesday, May 14, 2013. 11 a.m. - 12 p.m.
Where: Room H-767, Henry F. Hall Building (1455 De Maisonneuve Blvd. W.), Sir George Williams campus
notice
Guest Lecture: Mysteries of Search Trees
Attendance is free. No registration is necessary.
Robert E. Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University and a Visiting Researcher at Microsoft Research. He is an expert in the design and analysis of data structures and graph algorithms. He is a member of the U.S. National Academy of Sciences and of the U.S. National Academy of Engineering.