{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:33Z","timestamp":1725619113103},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_31","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"416-430","source":"Crossref","is-referenced-by-count":14,"title":["Self-Stabilizing De Bruijn Networks"],"prefix":"10.1007","author":[{"given":"Andr\u00e9a","family":"Richa","sequence":"first","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Phillip","family":"Stevens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: Proc. of the 17th Intl. Parallel and Distributed Processing Symposium (IPDPS), p. 40 (2003)","key":"31_CR1","DOI":"10.1109\/IPDPS.2003.1213125"},{"doi-asserted-by":"crossref","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Brief announcement: a framework for building self-stabilizing overlay networks. In: Proc. of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pp. 398\u2013399 (2010)","key":"31_CR2","DOI":"10.1145\/1835698.1835790"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S012962641000003X","volume":"20","author":"E. Caron","year":"2010","unstructured":"Caron, E., Desprez, F., Petit, F., Tedeschi, C.: Snap-stabilizing prefix tree for peer-to-peer systems. Parallel Processing Letters\u00a020(1), 15\u201330 (2010)","journal-title":"Parallel Processing Letters"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-89335-6_12","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T. Clouser","year":"2008","unstructured":"Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: A self-stabilizing deterministic skip list. In: Kulkarni, S., Schiper, A. (eds.) SSS 2008. LNCS, vol.\u00a05340, pp. 124\u2013140. Springer, Heidelberg (2008)"},{"unstructured":"Cramer, C., Fuhrmann, T.: Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe (2005)","key":"31_CR5"},{"key":"31_CR6","first-page":"758","volume":"49","author":"N. Bruijn De","year":"1946","unstructured":"De Bruijn, N.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen\u00a049, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2005.12.006","volume":"355","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gauron, P.: D2B: A De Bruijn based content-addressable network. Theoretical Computer Science\u00a0355(1), 65\u201379 (2006)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: Time complexity of distributed topological self-stabilization: The case of graph linearization. In: Proc. of the 9th Latin American Theoretical Informatics Symposium, pp. 294\u2013305 (2010)","key":"31_CR8","DOI":"10.1007\/978-3-642-12200-2_27"},{"doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., Taeubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proc. of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 131\u2013140 (2009)","key":"31_CR9","DOI":"10.1145\/1582716.1582741"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-642-10631-6_78","volume-title":"Algorithms and Computation","author":"R. Jacob","year":"2009","unstructured":"Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A Self-stabilizing and Local Delaunay Graph Construction. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 771\u2013780. Springer, Heidelberg (2009)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"M. Kaashoek","year":"2003","unstructured":"Kaashoek, M., Karger, D.: Koorde: A Simple Degree-Optimal Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. of the 29th ACM Symposium on Theory of Computing, STOC (1997)","key":"31_CR12","DOI":"10.1145\/258533.258660"},{"doi-asserted-by":"crossref","unstructured":"Kniesburges, S., Koutsopoulos, A., Scheideler, C.: Re-Chord: A self-stabilizing Chord overlay network. To appear in Proc. of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2011)","key":"31_CR13","DOI":"10.1145\/1989493.1989527"},{"doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: Proc. of the 2003 ACM SIGCOMM Conference, pp. 395\u2013406 (2003)","key":"31_CR14","DOI":"10.1145\/863955.863999"},{"doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st ACM Symposium on Principles of Distributed Computing, PODC (2002)","key":"31_CR15","DOI":"10.1145\/571825.571857"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approch. In: Proc. of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 50\u201359 (2003)","key":"31_CR16","DOI":"10.1145\/777417.777421"},{"doi-asserted-by":"crossref","unstructured":"Onus, M., Richa, A., Scheideler, C.: Linearization: Locally Self-Stabilizing Sorting in Graphs. In: Proc. of the 9th Workshop on Algorithm Engineering and Experiments, ALENEX (2007)","key":"31_CR17","DOI":"10.1137\/1.9781611972870.10"},{"doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of the ACM SIGCOMM Data Communication Festival (2001)","key":"31_CR18","DOI":"10.1145\/383059.383072"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-02930-1_47","volume-title":"Automata, Languages and Programming","author":"C. Scheideler","year":"2009","unstructured":"Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 571\u2013582. Springer, Heidelberg (2009)"},{"issue":"1","key":"31_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer look-up protocol for internet applications. IEEE\/ACM Transactions on Networking\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T02:53:56Z","timestamp":1560740036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}