<--- Back to Details
First PageDocument Content
Computing / Distributed computing / Peer-to-peer / BitTorrent / Gnutella / Ono / Breadth-first search / Network coding / Distributed hash table / File sharing networks / Distributed data storage / Concurrent computing
Date: 2012-06-13 00:42:15
Computing
Distributed computing
Peer-to-peer
BitTorrent
Gnutella
Ono
Breadth-first search
Network coding
Distributed hash table
File sharing networks
Distributed data storage
Concurrent computing

Microsoft Word - CCD_p-to-q_JSACPaper_TechnicalReport.doc

Add to Reading List

Source URL: www.eee.hku.hk

Download Document from Source Website

File Size: 351,23 KB

Share Document on Facebook

Similar Documents

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON DYNAMIC BREADTH-FIRST SEARCH IN EXTERNAL-MEMORY ULRICH MEYER 1

DocID: 1uYtC - View Document

Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv

DocID: 1uX4F - View Document

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

DocID: 1tfnh - View Document

Graph theory / Mathematics / Search algorithms / Graph traversal / Breadth-first search / Vertex / NP-complete problems / Graph coloring / Planar graphs / Depth-first search

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document

Graph theory / Mathematics / Search algorithms / Algebraic graph theory / Graph connectivity / Adjacency matrix / Matrices / Depth-first search / Adjacency list / Breadth-first search / Graph / Topological sorting

6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

DocID: 1rsoU - View Document