{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:15Z","timestamp":1725664035330},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/3-540-56188-9_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:50Z","timestamp":1330253810000},"page":"110-119","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tentative and definite distributed computations: An optimistic approach to network synchronization"],"prefix":"10.1007","author":[{"given":"J.","family":"Garofalakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Tampakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch B., \u201cComplexity of Network Synchronization\u201d, JACM, Vol. 32, No 4, Oct. 1985.","DOI":"10.1145\/4221.4227"},{"key":"8_CR2","unstructured":"Awerbuch B., Peleg D., \u201cNetwork Synchronization with Polylogarithmic Overhead\u201d, Proc. IEEE FOCS, 1990."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"C Commoner F., Holt W., Even S., Pnueli A., \u201cMarked Directed Graphs\u201d, JCSS, Vol. 5, No 5, 1971.","DOI":"10.1016\/S0022-0000(71)80013-2"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chandy K.M., Lamport L., \u201cDistributed Snapshots: Determining Global States of Distributed Systems\u201d, ACM Trans. on Computer Systems, Vol. 3, No 1, 1985.","DOI":"10.1145\/214451.214456"},{"key":"8_CR5","volume-title":"TR #522","author":"E. Even","year":"1988","unstructured":"Even E., Rajsbaum S., \u201cLack of Global Clock Does Not Slow Down the Computation in Distributed Networks\u201d, TR #522, Dep. of Comp. Sc., Haifa, Israel, Oct. 1988. The first part of this paper will appear with the title \u201cUnison in Distributed Networks\u201d in Sequenses, Combinatorica, Compression, Security and Transmission, R.M. Capocelli (ed.), Springer-Verlag."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Even E., Rajsbaum S., \u201cThe use of a Synchronizer Yields Maximum Rate in Distributed Networks\u201d, Proc. 22nd ACM STOC, 1990.","DOI":"10.1145\/100216.100227"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Kedem Z., Palem K., Raghunathan A., Spirakis P., \u201cCombining Tentative and Definite Executions for Very Fast Dependable Parallel Computing\u201d, Proc. ACM STOC 1991.","DOI":"10.1145\/103418.103459"},{"issue":"No4","key":"8_CR8","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg D., Ullman J., \u201cAn Optimal Synchronizer for the Hypercube\u201d, SIAM J.Computing, Vol. 18, No 4, Aug. 1989, pp 740\u2013747.","journal-title":"SIAM J.Computing"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Ross S.M., \u201cStochastic Processes\u201d, Wiley, 1983.","DOI":"10.1016\/B978-0-12-598420-1.50011-8"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Rajsbaum S., Sidi M., \u201cOn the Average Performance of Synchronized Programs in Distributed Networks\u201d, Proc. WDAG 1990.","DOI":"10.1007\/3-540-54099-7_8"},{"key":"8_CR11","volume-title":"PhD dissertation","author":"J. C. Wyllie","year":"1981","unstructured":"J. C. Wyllie, \u201cThe Complexity of Parallel Computations\u201d, PhD dissertation, Comp. Sc. Department, Cornell University, Ithaca, New York, 1981."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:42:09Z","timestamp":1558269729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}