Koorde

Results: 56



#Item
41Space-efficient and exact de Bruijn graph representation based on a Bloom filter Rayan Chikhi1 and Guillaume Rizk2 1  Computer Science department, ENS Cachan/IRISA, 35042 Rennes, France

Space-efficient and exact de Bruijn graph representation based on a Bloom filter Rayan Chikhi1 and Guillaume Rizk2 1 Computer Science department, ENS Cachan/IRISA, 35042 Rennes, France

Add to Reading List

Source URL: minia.genouest.org

Language: English - Date: 2012-10-09 11:54:51
42The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi∗, R. Gummadi†, S. Gribble‡, S. Ratnasamy§, S. Shenker¶, I. Stoica, ∗

The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi∗, R. Gummadi†, S. Gribble‡, S. Ratnasamy§, S. Shenker¶, I. Stoica, ∗

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2003-07-24 11:26:27
43Know thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗† Gurmeet Singh Manku‡ Moni Naor§¶

Know thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗† Gurmeet Singh Manku‡ Moni Naor§¶

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:54
44Towards a Scalable and Robust DHT Baruch Awerbuch∗ Christian Scheideler  Department of Computer Science

Towards a Scalable and Robust DHT Baruch Awerbuch∗ Christian Scheideler Department of Computer Science

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2006-06-07 15:26:28
45Efficient Routing for Peer-to-Peer Overlays Anjali Gupta, Barbara Liskov, and Rodrigo Rodrigues MIT Computer Science and Artificial Intelligence Laboratory {anjali,liskov,rodrigo}@csail.mit.edu  Abstract

Efficient Routing for Peer-to-Peer Overlays Anjali Gupta, Barbara Liskov, and Rodrigo Rodrigues MIT Computer Science and Artificial Intelligence Laboratory {anjali,liskov,rodrigo}@csail.mit.edu Abstract

Add to Reading List

Source URL: pmg.lcs.mit.edu

Language: English - Date: 2004-03-01 13:48:20
46LogKV: Exploiting Key-Value Stores for Event Log Processing Zhao Cao1 1  Shimin Chen1

LogKV: Exploiting Key-Value Stores for Event Log Processing Zhao Cao1 1 Shimin Chen1

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2012-12-04 12:10:44
47Fault-Tolerant Aggregation for Dynamic Networks Carlos Baquero Paulo Jesus  Paulo S´ergio Almeida

Fault-Tolerant Aggregation for Dynamic Networks Carlos Baquero Paulo Jesus Paulo S´ergio Almeida

Add to Reading List

Source URL: gsd.di.uminho.pt

Language: English - Date: 2010-10-08 06:47:53
48

PDF Document

Add to Reading List

Source URL: www.medicine-science.net23.net

Language: English - Date: 2013-02-01 02:02:16
49Sloppy hashing and self-organizing clusters Michael J. Freedman and David Mazi`eres NYU Dept of Computer Science {mfreed,dm}@cs.nyu.edu http://www.scs.cs.nyu.edu/coral/ Abstract

Sloppy hashing and self-organizing clusters Michael J. Freedman and David Mazi`eres NYU Dept of Computer Science {mfreed,dm}@cs.nyu.edu http://www.scs.cs.nyu.edu/coral/ Abstract

Add to Reading List

Source URL: www.coralcdn.org

Language: English - Date: 2003-02-09 22:19:00
50doi:[removed]j.comcom[removed]

doi:[removed]j.comcom[removed]

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Language: English - Date: 2010-05-14 09:06:57