{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:08:58Z","timestamp":1758892138066,"version":"3.40.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035772"},{"type":"electronic","value":"9783319035789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03578-9_14","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T13:52:11Z","timestamp":1383918731000},"page":"165-176","source":"Crossref","is-referenced-by-count":3,"title":["A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Kniesburges","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Koutsopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384\u2013393 (2003)"},{"key":"14_CR2","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA 2004, pp. 318\u2013327 (2004)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Brief announcement: a framework for building self-stabilizing overlay networks. In: PODC 2010, pp. 398\u2013399 (2010)","DOI":"10.1145\/1835698.1835790"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-15763-9_46","volume-title":"Distributed Computing","author":"L. Blin","year":"2010","unstructured":"Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S.: Fast self-stabilizing minimum spanning tree construction. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 480\u2013494. Springer, Heidelberg (2010)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.jpdc.2010.08.019","volume":"71","author":"L. Blin","year":"2011","unstructured":"Blin, L., Maria, G.P.-B., Rovedakis, S.: Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distrib. Comput.\u00a071(3), 438\u2013449 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"14_CR7","unstructured":"Curt Cramer and Thomas Fuhrmann. Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, University of Karlsruhe, TH (2005)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"W.D. Edsger","year":"1974","unstructured":"Edsger, W.D.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017, 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"6-7","key":"14_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.tcs.2008.10.006","volume":"410","author":"S. Dolev","year":"2009","unstructured":"Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theor. Comput. Sci.\u00a0410(6-7), 514\u2013532 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"H\u00e9rault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: A model for large scale self-stabilization. In: IPDPS, pp. 1\u201310 (2007)","DOI":"10.1109\/IPDPS.2007.370298"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A.W., Scheideler, C., Schmid, S., T\u00e4ubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: PODC, pp. 131\u2013140 (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"14_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.\u00a05878, pp. 771\u2013780. Springer, Heidelberg (2009)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC 2002, pp. 183\u2013192 (2002)","DOI":"10.1145\/571855.571857"},{"key":"14_CR14","volume-title":"Advanced Courses in Mathematics","author":"A.G. Myasnikov","year":"2008","unstructured":"Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Group-based cryptography. In: Advanced Courses in Mathematics, Birkh\u00e4user Verlag, CRM Barcelona (2008)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for p2p applications: The continuous-discrete approach. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273350"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Onus, M., Richa, A.W., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.10"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"14_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: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology p2p systems. In: Peer-to-Peer Computing, pp. 39\u201346 (2005)","DOI":"10.1109\/P2P.2005.34"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Pandurangan, G., Peleg, D., Rajaraman, R., Sun, Z.: Discovery through Gossip. In: SPAA (2011)","DOI":"10.1145\/2312005.2312031"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Liben-nowell, D., Karger, D., Frans, M., Dabek, K.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/964723.383071"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: PODC 1999, pp. 229\u2013237 (1999)","DOI":"10.1145\/301308.301362"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D., Vishkin Deterministic, U.: resource discovery in distributed networks. In: SPAA 2001, pp. 77\u201383 (2001)","DOI":"10.1145\/378580.378592"},{"issue":"4","key":"14_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.jpdc.2008.11.006","volume":"69","author":"K.M. Konwar","year":"2009","unstructured":"Konwar, K.M., Kowalski, D., Shvartsman, A.A.: Node discovery in networks In. J. Parallel Distrib. Comput.\u00a069(4), 337\u2013348 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Kniesburge, S., Koutsopoulos, A., Scheideler, C.: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Pre-Print) In: arXiv:1306.1692 (2013)","DOI":"10.1007\/978-3-319-03578-9_14"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03578-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T19:56:35Z","timestamp":1746042995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03578-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035772","9783319035789"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03578-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}