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

  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

Range Minimum Query & Lowest Common Ancestor

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Biochemistry Seminar Series - External Speakers Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT Peter Whittle Lecture

Other talks

Group Work Shining a light on the origin of supermassive black holes with cosmological simulations Title to be confirmed CPH IRC and PHI title and abstract tba (joint seminar with Spectral Geometry in the Clouds) Whether and when: Split-population cure models of women's work and parity progression in Derbyshire, 1881-1911
 

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