@conference {1251532,
	title = {Non-transitive connectivity and DHTs},
	booktitle = {WORLDS{\textquoteright}05: Proceedings of the 2nd conference on Real, Large Distributed Systems},
	year = {2005},
	pages = {55{\textendash}60},
	publisher = {USENIX Association},
	organization = {USENIX Association},
	address = {Berkeley, CA, USA},
	abstract = {The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For example, the Chord DHT assigns each node},
	keywords = {Chord, distributed hash table},
	url = {http://portal.acm.org/citation.cfm?id=1251532$\#$},
	author = {Michael J. Freedman and Lakshminarayanan, Karthik and Rhea, Sean C. and Ion Stoica}
}

{"_id":"CDu53oDrAEJkhRTyY","bibbaseid":"freedman-lakshminarayanan-rhea-stoica-nontransitiveconnectivityanddhts-2005","downloads":0,"creationDate":"2018-07-03T04:50:27.386Z","title":"Non-transitive connectivity and DHTs","author_short":["Freedman, M. J.","Lakshminarayanan, K.","Rhea, S. C.","Stoica, I."],"year":2005,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Non-transitive connectivity and DHTs","booktitle":"WORLDS\\textquoteright05: Proceedings of the 2nd conference on Real, Large Distributed Systems","year":"2005","pages":"55\\textendash60","publisher":"USENIX Association","organization":"USENIX Association","address":"Berkeley, CA, USA","abstract":"The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For example, the Chord DHT assigns each node","keywords":"Chord, distributed hash table","url":"http://portal.acm.org/citation.cfm?id=1251532$#$","author":[{"firstnames":["Michael","J."],"propositions":[],"lastnames":["Freedman"],"suffixes":[]},{"propositions":[],"lastnames":["Lakshminarayanan"],"firstnames":["Karthik"],"suffixes":[]},{"propositions":[],"lastnames":["Rhea"],"firstnames":["Sean","C."],"suffixes":[]},{"firstnames":["Ion"],"propositions":[],"lastnames":["Stoica"],"suffixes":[]}],"bibtex":"@conference {1251532,\n\ttitle = {Non-transitive connectivity and DHTs},\n\tbooktitle = {WORLDS{\\textquoteright}05: Proceedings of the 2nd conference on Real, Large Distributed Systems},\n\tyear = {2005},\n\tpages = {55{\\textendash}60},\n\tpublisher = {USENIX Association},\n\torganization = {USENIX Association},\n\taddress = {Berkeley, CA, USA},\n\tabstract = {The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For example, the Chord DHT assigns each node},\n\tkeywords = {Chord, distributed hash table},\n\turl = {http://portal.acm.org/citation.cfm?id=1251532$\\#$},\n\tauthor = {Michael J. Freedman and Lakshminarayanan, Karthik and Rhea, Sean C. and Ion Stoica}\n}\n","author_short":["Freedman, M. J.","Lakshminarayanan, K.","Rhea, S. C.","Stoica, I."],"key":"1251532","id":"1251532","bibbaseid":"freedman-lakshminarayanan-rhea-stoica-nontransitiveconnectivityanddhts-2005","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1251532$#$"},"keyword":["Chord","distributed hash table"],"downloads":0},"search_terms":["non","transitive","connectivity","dhts","freedman","lakshminarayanan","rhea","stoica"],"keywords":["chord","distributed hash table"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}