{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:08:16Z","timestamp":1775254096569,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030032319","type":"print"},{"value":"9783030032326","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_1","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Self-stabilizing Hashed Patricia Trie"],"prefix":"10.1007","author":[{"given":"Till","family":"Knollmann","sequence":"first","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-54099-7_2","volume-title":"Distributed Algorithms","author":"Y Afek","year":"1991","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 15\u201328. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54099-7_2"},{"issue":"9","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A Arora","year":"1994","unstructured":"Arora, A., Gouda, M.: Distributed reset. IEEE Trans. Comput. 43(9), 1026\u20131038 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp. 258\u2013267. IEEE, October 1991","DOI":"10.1109\/SFCS.1991.185377"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2011.12.079","volume":"428","author":"T Clouser","year":"2012","unstructured":"Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: a self-stabilizing deterministic skip list and skip graph. Theor. Comput. Sci. 428, 18\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(94)90103-1","volume":"49","author":"Z Collin","year":"1994","unstructured":"Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Inf. Process. Lett. 49(6), 297\u2013301 (1994)","journal-title":"Inf. Process. Lett."},{"key":"1_CR6","unstructured":"Cramer, C., Fuhrmann, T.: Self-stabilizing ring networks on connected graphs. Technical report, University of Karlsruhe (2005)"},{"issue":"11","key":"1_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Dolev, S., Kat, R.I.: HyperTree for self-stabilizing peer-to-peer systems. In: 3rd IEEE International Symposium on Proceedings of the Network Computing and Applications. NCA 2004, pp. 25\u201332. IEEE Computer Society, Washington, DC (2004)","DOI":"10.1109\/NCA.2004.1347757"},{"issue":"6","key":"1_CR9","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/32.295897","volume":"20","author":"M Flatebo","year":"1994","unstructured":"Flatebo, M., Datta, A.K.: Two-state self-stabilizing algorithms for token rings. IEEE Trans. Softw. Eng. 20(6), 500\u2013504 (1994)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR10","first-page":"66","volume-title":"Information Retrieval","author":"GH Gonnet","year":"1992","unstructured":"Gonnet, G.H., Baeza-Yates, R.A., Snider, T.: New indices for text: PAT Trees and PAT arrays. In: Frakes, W.B., Baeza-Yates, R. (eds.) Information Retrieval, pp. 66\u201382. Prentice-Hall Inc., Upper Saddle River (1992)"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/2629695","volume":"61","author":"R Jacob","year":"2014","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: SKIP+: a self-stabilizing skip graph. J. ACM 61(6), 36 (2014)","journal-title":"J. ACM"},{"key":"1_CR12","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. 5878, pp. 771\u2013780. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_78"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kniesburges, S., Koutsopoulos, A., Scheideler, C.: Re-chord: a self-stabilizing chord overlay network. In: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA 2011, pp. 235\u2013244. ACM, New York (2011)","DOI":"10.1145\/1989493.1989527"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-19094-0_18","volume-title":"WALCOM: Algorithms and Computation","author":"S Kniesburges","year":"2011","unstructured":"Kniesburges, S., Scheideler, C.: Hashed Patricia Trie: efficient longest prefix matching in peer-to-peer systems. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_18"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Knollmann, T., Scheideler, C.: A Self-stabilizing hashed Patricia Trie. ArXiv e-prints. http:\/\/arxiv.org\/abs\/1809.04923 (2018)","DOI":"10.1007\/978-3-030-03232-6_1"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/1.9781611972870.10","volume-title":"2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Melih Onus","year":"2007","unstructured":"Onus, M., Richa, A., Scheideler, C.: Linearization: locally self-stabilizing sorting in graphs. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments, pp. 99\u2013108. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"1_CR18","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: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329\u2013350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45518-3_18"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology P2P systems. In: Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, pp. 39\u201346. IEEE, August 2005","DOI":"10.1109\/P2P.2005.34"},{"issue":"1","key":"1_CR20","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. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."}],"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-030-03232-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:49:24Z","timestamp":1775249364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}