{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:54Z","timestamp":1740099174073,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"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_5","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T11:44:48Z","timestamp":1539949488000},"page":"65-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A $$O(\\log n)$$ Distributed Algorithm to Construct Routing Structures for Pub\/Sub Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9964-8816","authenticated-orcid":false,"given":"Volker","family":"Turau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N Alon","year":"1995","unstructured":"Alon, N., Karp, R., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/TPDS.2008.257","volume":"20","author":"A Banerjee","year":"2009","unstructured":"Banerjee, A., King, C.-T.: Building ring-like overlays on wireless ad hoc and sensor networks. IEEE Trans. Parallel Distrib. Syst. 20(11), 1553\u20131566 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Fathi, R., Pandurangan, G., Pham, N.D.: Fast and efficient distributed computation of hamiltonian cycles in random graphs. In: Proceedings of 38th International Conference on Distributed Computing Systems, ICDCS 2018 (2018)","DOI":"10.1109\/ICDCS.2018.00079"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TNET.2014.2369346","volume":"24","author":"C Chen","year":"2016","unstructured":"Chen, C., Jacobsen, H.-A., Vitenberg, R.: Algorithms based on divide and conquer for topic-based publish\/subscribe overlay design. IEEE Trans. Netw. 24(1), 422\u2013436 (2016)","journal-title":"IEEE Trans. Netw."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-33651-5_6","volume-title":"Distributed Computing","author":"C Chen","year":"2012","unstructured":"Chen, C., Vitenberg, R., Jacobsen, H.-A.: A generalized algorithm for publish\/subscribe overlay design and its fast implementation. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 76\u201390. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_6"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for Pub-Sub with many topics. In: Proceedings of 22nd Annual ACM Symposium Principles of Distributed Computing, pp. 109\u2013118 (2007)","DOI":"10.1145\/1281100.1281118"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. (Debr.) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debr.)"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015)"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","volume":"61","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency for routing schemes of stretch factor three. J. Parallel Distrib. Comput. 61(5), 679\u2013687 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR11","unstructured":"H\u00e9lary, J., Raynal, M.: Depth-first traversal and virtual ring construction in distributed systems. Research Report RR-0704, IRISA-Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires, INRIA Rennes (1987)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2015.08.037","volume":"605","author":"K Krzywdzi\u0144ski","year":"2015","unstructured":"Krzywdzi\u0144ski, K., Rybarczyk, K.: Distributed algorithms for random graphs. Theor. Comput. Sci. 605, 95\u2013105 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11527954_7","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"E Levy","year":"2005","unstructured":"Levy, E., Louchard, G., Petit, J.: A distributed algorithm to find hamiltonian cycles in $$\\cal{G}(n, p)$$ random graphs. In: L\u00f3pez-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol. 3405, pp. 63\u201374. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527954_7"},{"issue":"5","key":"5_CR14","doi-asserted-by":"publisher","first-page":"38:1","DOI":"10.1145\/2786753","volume":"62","author":"Z Lotker","year":"2015","unstructured":"Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. J. ACM 62(5), 38:1\u201338:17 (2015)","journal-title":"J. ACM"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.comnet.2015.10.023","volume":"94","author":"M Onus","year":"2016","unstructured":"Onus, M., Richa, A.W.: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. Comput. Netw. 94, 307\u2013317 (2016)","journal-title":"Comput. Netw."},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u201d \u2014 a simple and tight analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159\u2013170. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49543-6_13"},{"key":"5_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"},{"issue":"2","key":"5_CR19","first-page":"12:1","volume":"2","author":"G Siegemund","year":"2018","unstructured":"Siegemund, G., Turau, V.: A self-stabilizing publish\/subscribe middleware for IoT applications. ACM Trans. Cyber-Phys. Syst. (TCPS) 2(2), 12:1\u201312:26 (2018)","journal-title":"ACM Trans. Cyber-Phys. Syst. (TCPS)"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31(4), 149\u2013160 (2001)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, pp. 1\u201310. ACM, New York (2001)","DOI":"10.1145\/378580.378581"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Turau, V.: A distributed algorithm for finding hamiltonian cycles in random graphs in $$O(\\log n)$$ time. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_11","DOI":"10.1007\/978-3-030-01325-7_11"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Turau, V., Siegemund, G.: Scalable routing for topic-based publish\/subscribe systems under fluctuations. In: Proceedings of 37th International Conference on Distributed Computing Systems, ICDCS 2017 (2017)","DOI":"10.1109\/ICDCS.2017.27"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T05:21:18Z","timestamp":1693977678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_5"}},"subtitle":["Regular Submission"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}