{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:02:15Z","timestamp":1749646935970},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893349"},{"type":"electronic","value":"9783540893356"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89335-6_12","type":"book-chapter","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T14:31:45Z","timestamp":1226413905000},"page":"124-140","source":"Crossref","is-referenced-by-count":19,"title":["Tiara: A Self-stabilizing Deterministic Skip List"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Clouser","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","first-page":"384","volume-title":"SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 384\u2013393. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"12_CR3","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":"12_CR4","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":"12_CR5","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":"12_CR6","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":"12_CR7","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":"12_CR8","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: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"issue":"1","key":"12_CR9","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 Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Scheideler, C.: Group spreading: A protocol for provably secure distributed name service. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142. Springer, Heidelberg (2004)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Self-star Properties in Complex Information Systems","author":"L.O. Alima","year":"2005","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: Babao\u011flu, \u00d6., Jelasity, M., Montresor, A., Fetzer, C., Leonardi, S., van Moorsel, A., van Steen, M. (eds.) SELF-STAR 2004. LNCS, vol.\u00a03460. Springer, Heidelberg (2005)"},{"key":"12_CR12","volume-title":"ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments","author":"M. Onus","year":"2007","unstructured":"Onus, M., Richa, A.W., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments, January 2007. SIAM, Philadelphia (2007)"},{"key":"12_CR13","first-page":"39","volume-title":"P2P 2005: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing","author":"A. Shaker","year":"2005","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology p2p systems. In: P2P 2005: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, Washington, DC, USA, pp. 39\u201346. IEEE Computer Society, Los Alamitos (2005)"},{"key":"12_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":"12_CR15","first-page":"365","volume-title":"IPCCC 2005: Proceedings of the 24th IEEE International Performance Computing and Communications Conference","author":"C. Cramer","year":"2005","unstructured":"Cramer, C., Fuhrmann, T.: Isprp: a message-efficient protocol for initializing structured p2p networks. In: IPCCC 2005: Proceedings of the 24th IEEE International Performance Computing and Communications Conference, April 2005, pp. 365\u2013370. IEEE, Los Alamitos (2005)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-76627-8_9","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"E. Caron","year":"2007","unstructured":"Caron, E., Desprez, F., Petit, F., Tedeschi, C.: Snap-stabilizing prefix tree for peer-to-peer systems. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol.\u00a04838, pp. 82\u201396. Springer, Heidelberg (2007)"},{"key":"12_CR17","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, Washington, DC, USA, p. 27. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"5","key":"12_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00446-007-0038-9","volume":"20","author":"S. Dolev","year":"2008","unstructured":"Dolev, S., Kat, R.I.: Hypertree for self-stabilizing peer-to-peer systems. Distributed Computing\u00a020(5), 375\u2013388 (2008)","journal-title":"Distributed Computing"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-77096-1_25","volume-title":"Principles of Distributed Systems","author":"D. Dolev","year":"2007","unstructured":"Dolev, D., Hoch, E., van Renesse, R.: Self-stabilizing and byzantine-tolerant overlay network. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 343\u2013357. Springer, Heidelberg (2007)"},{"issue":"6","key":"12_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. Commun. ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"12_CR21","first-page":"367","volume-title":"SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms,","author":"J.I. Munro","year":"1992","unstructured":"Munro, J.I., Papadakis, T., Sedgewick, R.: Deterministic skip lists. In: SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 367\u2013375. Society for Industrial and Applied Mathematics, Philadelphia (1992)"},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ipl.2004.01.019","volume":"90","author":"N.J.A. Harvey","year":"2004","unstructured":"Harvey, N.J.A., Munro, J.I.: Deterministic skipnet. Inf. Process. Lett.\u00a090(4), 205\u2013208 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Patterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"12_CR25","first-page":"225","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Communications of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: A self-stabilizing deterministic skip list. Technical Report TR-KSU-CS-2008-04, Department of Computer Science, Kent State University (June 2008)","key":"12_CR26","DOI":"10.1007\/978-3-540-89335-6_12"}],"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-540-89335-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:11:06Z","timestamp":1557911466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89335-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893349","9783540893356"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89335-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}