6.851: Advanced Data Structures Spring 2010

First Page		Document Content
Date: 2010-03-03 14:34:41 Suffix tree Range Minimum Query Binary search tree Tree Rope Suffix array B-tree String searching algorithm Graph theory Binary trees Lowest common ancestor		6.851: Advanced Data Structures Spring 2010 Add to Reading List Source URL: courses.csail.mit.edu Download Document from Source Website File Size: 89,69 KB Share Document on Facebook

	Indexing the Trajectories of Moving Objects in Symbolic Indoor Space Christian S. Jensen1 , Hua Lu1 , and Bin Yang1,2 1 Department of Computer Science, Aalborg University, Denmark DocID: 1pwME - View Document
	Range minimum query Advanced Algorithms – COMS31900 Preprocess an integer array A (length n) to answer range minimum queries DocID: 14Efx - View Document
	Lowest common ancestor Advanced Algorithms – COMS31900 Preprocess a tree T (with n nodes) to answer lowest common ancestor queries DocID: 14BwI - View Document
	Advanced Algorithms – COMS31900Lecture 10 Range minimum queries Benjamin Sach DocID: 14pQp - View Document
	lec15-scribenotes-part1.dvi DocID: n7d4 - View Document