University of Cambridge > Talks.cam > Churchill CompSci Talks > Iterative Development: the Lowest Common Ancestor Problem

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Iterative Development: the Lowest Common Ancestor Problem

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Computer Laboratory Opera Group Seminars Type the title of a new list here Main Lecture Theatre, Old Divinity School, St John's College, Cambridge

Other talks

Title to be confirmed Title TBC The Imagined Conflict: On Science and God Group Work Morning Tea and Coffee LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity