Iterative Development: the Lowest Common Ancestor Problem

Add to your list(s) Download to your calendar using vCal

• Vlad Gavrila, Churchill College
• Wednesday 03 February 2016, 19:00-19:40
• Wolfson Hall, Churchill College.

If you have a question about this talk, please contact Matthew Ireland.

Iterative development isn’t only applicable to software engineering: theoretical Computer Science problems may be solved with this approach too. In this talk, we shall explore varied solutions to the online Lowest Common Ancestor problem on rooted trees, a standard problem in graph theory which admits a variety of solutions. We shall see how each solution can be refined to create a new one, and how each improvement we make affects the computational complexity of the algorithms we derive. This talk is appropriate to every student from Part IA to Part III and it requires only minimal graph theory knowledge.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

• Churchill CompSci Talks
• Wolfson Hall, Churchill College
• computer science
• se393's list

Note that ex-directory lists are not shown.