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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

Surface, Microstructure and Fracture Talks Algebraic Geometry Seminar Study Group on a Langlands Correspondence for Loop Groups

Other talks

Plant Sciences Departmental Seminar Prospecting and bioprospecting on Russia's Central Asian cotton frontier, 1880s - 1916 Co-factors pose stoichiometric questions for Dicer complex assembly and precursor miRNA processing KRAB zinc finger proteins, transposable elements and the evolution of gene regulatory networks Blocks in the asymmetric simple exclusion process Eruptions, Emissions and Enigmas: from fuming volcanic vents to mass extinction events
 

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