University of Cambridge > > Churchill CompSci Talks > Range Minimum Query & Lowest Common Ancestor

Range Minimum Query & Lowest Common Ancestor

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

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

This talk presents different approaches for two very important algorithmic problems: Range Minimum Query on arrays and Lowest Common Ancestor between two nodes in a tree. Even if these may not seem very similar at first, we will show how they can be reduced one to another in linear time and why this is not only very beautiful, but also useful.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity