{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:51Z","timestamp":1740029151575,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_27","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"294-305","source":"Crossref","is-referenced-by-count":12,"title":["Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Gall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Richa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanjo","family":"T\u00e4ubig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 384\u2013393 (2003)"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0097539793259471","volume":"27","author":"R.D. Blumofe","year":"1998","unstructured":"Blumofe, R.D., Leiserson, C.E.: Space-e cient scheduling of multithreaded computations. SIAM Journal on Computing\u00a027(1), 202\u2013229 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"27_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"R.D. Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. Journal of the ACM\u00a046(5), 720\u2013748 (1999)","journal-title":"Journal of the ACM"},{"key":"27_CR4","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., Schiper, A. (eds.) SSS 2008. LNCS, vol.\u00a05340, pp. 124\u2013140. Springer, Heidelberg (2008)"},{"key":"27_CR5","unstructured":"Cramer, C., Fuhrmann, T.: Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe (2005)"},{"key":"27_CR6","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.N., 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":"5","key":"27_CR7","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":"27_CR8","unstructured":"Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: Modeling scalability in distributed self-stabilization: The case of graph linearization. Technical Report TUM-I0835, Technische Universit\u00e4t M\u00fcnchen, Computer Science Dept. (November 2008)"},{"key":"27_CR9","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. ACM Symp. on Principles of Distributed Computing, PODC (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2009)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11558989_2","volume-title":"Peer-to-Peer Systems IV","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 13\u201323. Springer, Heidelberg (2005)"},{"key":"27_CR12","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_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-02930-1_47","volume-title":"Automata, Languages and Programming","author":"C. Scheideler","year":"2009","unstructured":"Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 571\u2013582. Springer, Heidelberg (2009)"},{"key":"27_CR14","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"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. Technical Report MIT-LCS-TR-819. MIT (2001)","DOI":"10.1145\/383059.383071"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T03:13:00Z","timestamp":1740021180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}