BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Iterative Development: the Lowest Common Ancestor Problem - Vlad G
 avrila\, Churchill College
DTSTART:20160203T190000Z
DTEND:20160203T194000Z
UID:TALK62543@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Iterative development isn't only applicable to software engine
 ering: theoretical Computer Science problems may be solved with this appro
 ach too. In this talk\, we shall explore varied solutions to the online Lo
 west Common Ancestor problem on rooted trees\, a standard problem in graph
  theory which admits a variety of solutions. We shall see how each solutio
 n can be refined to create a new one\, and how each improvement we make af
 fects the computational complexity of the algorithms we derive. This talk 
 is appropriate to every student from Part IA to Part III and it requires o
 nly minimal graph theory knowledge.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR