{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:47Z","timestamp":1725663767202},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"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-57811-0_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:24:04Z","timestamp":1330244644000},"page":"167-178","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-message trade-offs for the weak unison problem"],"prefix":"10.1007","author":[{"given":"Amos","family":"Israeli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"No.1","key":"14_CR1","first-page":"11","volume":"1","author":"A. Arora","year":"1991","unstructured":"A. Arora, S. Dolev and M. Gouda, \u201cMaintaining Digital Clocks in Step\u201d, Proc. of the 5th International Workshop on Distributed Algorithms, 1991, Parallel Processing Letters, Vol. 1, No. 1, pp. 11\u201318, 1991.","journal-title":"Proc. of the 5th International Workshop on Distributed Algorithms, 1991, Parallel Processing Letters"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"H. Attiya and M. Snir and M. Warmuth, \u201cComputing on an Anonymous Ring\u201d, Journal of the ACM, 35 (4), 1988. (Short version has appeared in proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computation, 1985, 845\u2013875.)","DOI":"10.1145\/48014.48247"},{"key":"14_CR3","unstructured":"J.-M. Couvreur, N. Francez and M. Gouda, \u201cAsynchronous Unison\u201d, preprint."},{"key":"14_CR4","unstructured":"P. J. Davis, \u201cCirculant Matrices\u201d, John Wiley and Sons, 1979."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"S. Even and S. Rajsbaum, \u201cUnison in Distributed Networks\u201d, in \u201cSequences, Combinatorics, Compression, Security and Transmission\u201d, in Sequences, Combinatorics, Compression, Security and Transmission, R.M. Capocelli (ed.), SpringerVerlag, 1990, pp. 479\u2013487.)","DOI":"10.1007\/978-1-4612-3352-7_38"},{"key":"14_CR6","unstructured":"Unison, Canon and Sluggish Clocks in Networks Controlled by a Synchronizer. To appear in Mathematical Systems Theory."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"S. Even and S. Rajsbaum, \u201cThe Use of Synchronizer Yields Maximum Computation Rate in Distributed Networks\u201d, STOC 1990, pages 95\u2013105.","DOI":"10.1145\/100216.100227"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, S. Moran, S. Rudich and G. Taubenfeld, \u201cThe Wakeup Problem\u201d, STOC 1990, pages 106\u2013116.","DOI":"10.1145\/100216.100228"},{"issue":"No.4","key":"14_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(90)90020-X","volume":"35","author":"M. Gouda","year":"1990","unstructured":"M. Gouda and T. Herman, \u201cStabilizing Unison\u201d, Information Processing Letters, Vol. 35, No. 4, pages 171\u2013175, 1990.","journal-title":"Information Processing Letters"},{"key":"14_CR10","volume-title":"Boolean Matrix Theory and Applications","author":"K. H. Kim","year":"1982","unstructured":"Ki Hang Kim, \u201cBoolean Matrix Theory and Applications\u201d, Marcel Dekker Inc., New York, 1982."},{"key":"14_CR11","unstructured":"D. Knuth, \u201cThe Art Computer Programming: Fundamental Algorithms\u201d, Addison Wesley, 1973."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1008959.1008961","volume":"Number 16","author":"N. Santoro","year":"1984","unstructured":"N. Santoro, \u201cSense of Direction, Topological Awareness and Communication Complexity\u201d, ACM SIGACT News, Number 16, pages 50\u201356, 1984.","journal-title":"ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:30:46Z","timestamp":1578508246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_14"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_14","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":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}