Theoretical Computer Science[removed] – 12 www.elsevier.com locate tcs - Path graph - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2009-10-28 14:26:02 Search algorithms Network theory Shortest path problem B-tree Binary trees Routing algorithms Lowest common ancestor Tango tree Graph theory Mathematics Theoretical computer science		Theoretical Computer Science[removed] – 12 www.elsevier.com/locate/tcs Add to Reading List Source URL: w.cccg.ca Download Document from Source Website File Size: 196,88 KB Share Document on Facebook

	Amoeba Join: Overcoming Structural Fluctuations in XML Data Taro L. Saito Shinichi Morishita DocID: 1rnBF - View Document
	Design and Scalability of NLS, a Scalable Naming and Location Service Y. Charlie Hu, Daniel A. Rodney and Peter Druschel Computer Science Department Rice University Houston, TX 77005 , , d DocID: 1r55C - View Document
	Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin DocID: 1qJ8t - View Document
	WWW 2010 • Full Paper April 26-30 • Raleigh • NC • USA LCA-based Selection for XML Document Collections Georgia Koloniari DocID: 1qDxe - View Document
	Design Considerations for High Fan-in Systems: The HiFi Approach Michael J. Franklin, Shawn R. Jeffery, Sailesh Krishnamurthy, Frederick Reiss, Shariq Rizvi, Eugene Wu, Owen Cooper, Anil Edakkunni, and Wei Hong+ DocID: 1qBeX - View Document