{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:18Z","timestamp":1742617158874,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58218-5_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:37:35Z","timestamp":1330270655000},"page":"267-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On self-stabilizing wait-free clock synchronization"],"prefix":"10.1007","author":[{"given":"Marina","family":"Papatriantafilou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1142\/S0129626491000161","volume":"1","author":"A. Arora","year":"1991","unstructured":"A. Arora, S. Dolev, and M. Gouda. Maintaining Digital Clocks in Step. Parallel Processing Letters 1, 1, 1991, pp. 11\u201318.","journal-title":"Parallel Processing Letters 1"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, S. Kutten and M. Yung. Memory-Efficient Self Stabilization on General Networks. In Proceedings of the 4th International Workshop on Distributed Algorithms, volume 486 of Lecture Notes in Computer Science, Springer-Verlag 1990, pp. 15\u201328.","DOI":"10.1007\/3-540-54099-7_2"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"H. Attiya, N. A. Lynch and N. Shavit. Are Wait-Free Algorithms Fast? In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 55\u201364.","DOI":"10.21236\/ADA232829"},{"key":"25_CR4","unstructured":"B. Awerbuch, B. Patt-Shamir and G. Varghese. Local Checking and Correction. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 268\u2013277."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and G. Varghese. Distributed Program Checking: A Paradigm for Building Self-Stabilizing Distributed Protocols, In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 258\u2013267.","DOI":"10.1109\/SFCS.1991.185377"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"J.-M. Courver, N. Francez and M. Gouda. Asynchronous Unison. In Proceedings of the 12th IEEE Conference on Distributed Computing Systems, 1992, pp. 486\u2013493.","DOI":"10.1109\/ICDCS.1992.235005"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E.W. Dijkstra. Self Stabilizing Systems in Spite of Distributed Control. Communication of the ACM 17, 1974, pp. 643\u2013644.","journal-title":"Communication of the ACM"},{"issue":"2","key":"25_CR8","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0022-0000(86)90028-0","volume":"32","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, J.Y. Halpern and H.R. Strong. On the Possibility and Impossibility of Achieving Clock Synchronization. Journal of Computer Systems Science 32, 2, 1986, pp. 230\u2013250.","journal-title":"Journal of Computer Systems Science"},{"issue":"1","key":"25_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"S. Dolev, A. Israeli and S. Moran. Self Stabilization on Dynamic Systems Assuming Only Read\/Write Atomicity. Distributed Computing 7, 1, 1993, pp. 3\u201316.","journal-title":"Distributed Computing"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"S. Dolev and J.L. Welch. Wait-Free Clock Synchronization. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993. pp. 97\u2013108.","DOI":"10.1145\/164051.164066"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(90)90020-X","volume":"35","author":"M. G. Gouda","year":"1990","unstructured":"M.G. Gouda and T. Herman. Stabilizing Unison. Information Processing Letters 35, 1990, pp. 171\u2013175.","journal-title":"Information Processing Letters"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"J. Halpern, B. Simons, R. Strong and D. Dolev. Fault-Tolerant Clock Synchronization. In Proceedings Of the 3rd ACM Symposium on Principles of Distributed Computing, 1984, pp. 89\u2013102.","DOI":"10.1145\/800222.806739"},{"issue":"1","key":"25_CR13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M., Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 1 (Jan. 1991), pp. 124\u2013149.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR14","unstructured":"K. Hwang. Advanced Computer Architectures, Parallelism, Scalability, Programmability. McGraw-Hill, Inc. 1993."},{"key":"25_CR15","volume-title":"Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity","author":"R. Karp","year":"1990","unstructured":"R. Karp and V. Ramachandran. Parallel Algorithms for Shared Memory Machines. In J.van Leeuwen, ed., Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity Elsevier, Amsterdam 1990. Also in: Technical Report UCB\/CSD 88\/408, Computer Science Division, University of California, March 1988."},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport. On Interprocess Communication. Distributed Computing 1, 1, 1986, pp. 86\u2013101.","journal-title":"Distributed Computing"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, Inc., 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"1","key":"25_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2457","volume":"32","author":"L. Lamport","year":"1985","unstructured":"L. Lamport and P.M. Melliar-Smith. Synchronizing Clocks in the Presence of Faults. Journal of the ACM 32, 1, 1985, pp. 1\u201336.","journal-title":"Journal of the ACM"},{"key":"25_CR19","unstructured":"K. Marzullo. Loosely-Coupled Distributed Services: A Distributed Time Service, Ph.D. Thesis, Stanford University, 1983."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"S. Mahaney and F. Schneider. Inexact Agreement: Accuracy, Precision and Graceful Degradation. In Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, 1985, pp. 237\u2013249.","DOI":"10.1145\/323596.323618"},{"issue":"3","key":"25_CR21","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1145\/28869.28876","volume":"34","author":"T. K. Srikanth","year":"1987","unstructured":"T.K. Srikanth and S. Toueg. Optimal Clock Synchronization. Journal of the ACM 34, 3, 1987, pp. 626\u2013645.","journal-title":"Journal of the ACM"},{"key":"25_CR22","unstructured":"G. Varghese. Self-Stabilization by Local Checking and Correction. Ph.D. Thesis, MIT Laboratory for Computer Science, 1992."},{"issue":"1","key":"25_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(88)90043-0","volume":"77","author":"J. L. Welch","year":"1988","unstructured":"J.L. Welch and N. Lynch. A New Fault-Tolerant Algorithm for Clock Synchronization. Information and Computation 77, 1, 1988, pp. 1\u201336.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:23:50Z","timestamp":1742595830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}