{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:53:13Z","timestamp":1773229993089,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540552369","type":"print"},{"value":"9783540467892","type":"electronic"}],"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\/bfb0022451","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"242-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Analysis of distributed algorithms based on recurrence relations"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Malka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"issue":"No.4","key":"18_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cComplexity of Network Synchronization,\u201d J. of the ACM, Vol. 32, No. 4, Oct. 1985, pp. 804\u2013823.","journal-title":"J. of the ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Baratz, D. Peleg, \u201cCost-Sensitive Analysis of Communication Protocols,\u201d IEEE FOCS, 1990.","DOI":"10.21236\/ADA237356"},{"issue":"No4","key":"18_CR3","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V. C. Barbosa","year":"1989","unstructured":"V. C. Barbosa and E. Gafni, \u201cConcurrency in Heavily Loaded Neighborhood-Constrained Systems,\u201d ACM Trans. on Programming Languages and Systems, Vol. 11, No 4, Oct. 1989, pp. 562\u2013584.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"R. Cuninghame-Green, Minimax Algebra, Lecture Notes in Economics and Mathematical Systems, No. 166, Springer-Verlag, 1979.","DOI":"10.1007\/978-3-642-48708-8"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"K. M. Chandy and L. Lamport, \u201cDistributed Snapshots: Determining Global States of Distributed Systems,\u201d ACM Trans. on Computer Systems, Vol. 3, No 1, Feb. 1985.","DOI":"10.1145\/214451.214456"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"F. Commoner, A.W. Holt, S. Even, A. Pnueli, \u201cMarked Directed Graphs,\u201d J. of Computer and System Sciences, Vol, vn5, No 5, Oct. 1971.","DOI":"10.1016\/S0022-0000(71)80013-2"},{"issue":"No.6","key":"18_CR7","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/TC.1987.1676965","volume":"C-36","author":"I. Chlamtac","year":"1987","unstructured":"I. Chlamtac and S. Pinter, \u201cDistributed nodes organization algorithm for channel access in a multi-hop dynamic radio network,\u201d IEEE Trans. on Computers, vol. C-36, No. 6, June 1987, pp. 728\u2013737.","journal-title":"IEEE Trans. on Computers"},{"key":"18_CR8","volume-title":"It is included in \u201cLack of a Global Clock Does not Slow Down the Computation in Distributed Networks,\u201d TR-522","author":"S. Even","year":"1988","unstructured":"S. Even, S. Rajsbaum, \u201cUnison in Distributed Networks,\u201d Sequences, Combinatorial, Compression, Security, and Transmission, R.M. Capocelli (ed.), Springer-Verlag, 1989. It is included in \u201cLack of a Global Clock Does not Slow Down the Computation in Distributed Networks,\u201d TR-522, Department of Comp. Science, Technion, Haifa, Israel, October 1988."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"S. Even, S. Rajsbaum, \u201cThe Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks,\u201d Proc. 22th ACM STOC, 1990.","DOI":"10.1145\/100216.100227"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R. M. Karp","year":"1978","unstructured":"R. M. Karp, \u201cA Characterization of the Minimum Cycle Mean in a Digraph,\u201d Discrete Mathematics, Vol. 23, 1978, pp. 309\u2013311.","journal-title":"Discrete Mathematics"},{"issue":"4598","key":"18_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, M.P, Vecchi, \u201cOptimization by Simulated Annealing,\u201d Science220 (4598), pp. 671\u2013680 (May 13, 1983).","journal-title":"Science"},{"key":"18_CR12","volume-title":"Combinatorial Algorithms: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial Algorithms: Networks and Matroids, Holt, Rinehart, and Winston, 1976."},{"key":"18_CR13","unstructured":"J. Malka, S. Moran, S. Zaks, \u201cAnalysis of a Distributed Scheduler for Communication Networks,\u201d Technical Report # 495, Department of Computer Science, Technion, Haifa, Israel, Feb. 1988. Also in proceedings of the 3rd Agean Workshop on Computing, AWOC 88, Corfu, June 1988), LNCS, Vol 319, pp. 351\u2013360, Springer Verlag, 1988."},{"key":"18_CR14","unstructured":"Y. Ofek, I. Gopal, \u201cGenerating a Global Clock in a Distributed System,\u201d IBM Research Report, 1987."},{"issue":"no.5","key":"18_CR15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TSE.1980.230492","volume":"SE-6","author":"C.V. Ramamoorthy","year":"1980","unstructured":"C.V. Ramamoorthy and G.S. Ho, \u201cPerformance Evaluation of asynchronous concurrent systems using Petri Nets,\u201d IEEE Trans. Software Engineering, vol. SE-6, no. 5, pp. 440\u2013449, (1980).","journal-title":"IEEE Trans. Software Engineering"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"S. Rajsbaum, M. Sidi, \u201cOn the Average Performance of Synchronized Programs in Distributed Networks,\u201d 4th Int. Workshop on Distributed Algorithms, Italy, October 1990, LNCS 486.","DOI":"10.1007\/3-540-54099-7_8"},{"key":"18_CR17","unstructured":"S. Rajsbaum, \u201cStochastic Marked Graphs,\u201d to appear in 4th Int. Workshop on Petri Nets and Performance Models (PNPM91), Melbourn, Australia, Dec. 1991."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T10:55:54Z","timestamp":1683284154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022451"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552369","9783540467892"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0022451","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}