{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:02:22Z","timestamp":1749646942220,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_27","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T06:56:37Z","timestamp":1318056997000},"page":"356-370","source":"Crossref","is-referenced-by-count":17,"title":["Corona: A Stabilizing Deterministic Message-Passing Skip List"],"prefix":"10.1007","author":[{"given":"Rizal Mohd","family":"Nor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Alima, L.O., Haridi, S., Ghodsi, A., El-Ansary, S., Brand, P.: Position paper: Self-.properties in distributed k-ary structured overlay networks. In: Proceedings of SELF-STAR: International Workshop on Self-* Properties in Complex Information Systems (May 2004)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/502034.502048","volume-title":"SOSP 2001: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles","author":"D. Andersen","year":"2001","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP 2001: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, pp. 131\u2013145. ACM, New York (2001)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms\u00a03(4), 37:1\u201337:25 (2007)","DOI":"10.1145\/1290672.1290674"},{"key":"27_CR4","first-page":"318","volume-title":"SODA 2004: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA 2004: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 318\u2013327. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"27_CR5","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 Symp. on Principles of Distributed Computing (PODC), pp. 398\u2013399 (2010)","DOI":"10.1145\/1835698.1835790"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/1007912.1007938","volume-title":"SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"A. Bhargava","year":"2004","unstructured":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 170\u2013179. ACM, New York (2004)"},{"key":"27_CR7","first-page":"27","volume-title":"ICDCS 2007: Proceedings of the 27th International Conference on Distributed Computing Systems","author":"S. Bianchi","year":"2007","unstructured":"Bianchi, S., Datta, A., Felber, P., Gradinariu, M.: Stabilizing peer-to-peer spatial filters. In: ICDCS 2007: Proceedings of the 27th International Conference on Distributed Computing Systems, p. 27. IEEE Computer Society Press, Washington, DC, USA (2007)"},{"issue":"1","key":"27_CR8","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":"27_CR9","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.S., Schiper, A. (eds.) SSS 2008. LNCS, vol.\u00a05340, pp. 124\u2013140. Springer, Heidelberg (2008)"},{"key":"27_CR10","unstructured":"Cramer, C., Fuhrmann, T.: Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe (2005)"},{"issue":"11","key":"27_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilization in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"27_CR12","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, pp. 294\u2013305 (2010)","DOI":"10.1007\/978-3-642-12200-2_27"},{"key":"27_CR13","first-page":"9","volume-title":"USITS 2003: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems","author":"N.J.A. Harvey","year":"2003","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: USITS 2003: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems, p. 9. USENIX Association, Berkeley (2003)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-49823-0_44","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T. H\u00e9rault","year":"2006","unstructured":"H\u00e9rault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 574\u2013575. Springer, Heidelberg (2006)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proc. of the 28th ACM Symp. on Principles of Distributed Computing (PODC), pp. 131\u2013140 (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/571825.571857","volume-title":"PODC 2002: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC 2002: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 183\u2013192. ACM, New York (2002)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Nor, R., Nesterenko, M., Scheideler, C.: Corona: A stabilizing deterministic message-passing skip list. Technical Report TR-KSU-2011-01, CS Dept., Kent State University (May 2011)","DOI":"10.1007\/978-3-642-24550-3_27"},{"key":"27_CR18","volume-title":"Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"M. Onus","year":"2007","unstructured":"Onus, M., Richa, A., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2007)"},{"key":"27_CR19","volume-title":"ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments","author":"M. Onus","year":"2007","unstructured":"Onus, M., Richa, A., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments. SIAM, Philadelphia (2007)"},{"issue":"6","key":"27_CR20","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"key":"27_CR21","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":"C. Scheideler","year":"2009","unstructured":"Scheideler, C., Jacob, R., Ritscher, S., 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":"27_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM 2001: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: SIGCOMM 2001: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161\u2013172. ACM, New York (2001)"},{"key":"27_CR23","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..I.T. Rowstron","year":"2001","unstructured":"Rowstron, A.I.T., 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":"27_CR24","doi-asserted-by":"crossref","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology P2P systems. In: Proc. 5th IEEE International Conference on Peer-to-Peer Computing, pp. 39\u201346 (2005)","DOI":"10.1109\/P2P.2005.34"},{"issue":"1","key":"27_CR25","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., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup 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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T16:50:21Z","timestamp":1741798221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}