{"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":1773229993077,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory of Computing Systems"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1007\/bf02679457","type":"journal-article","created":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T04:57:56Z","timestamp":1185598676000},"page":"447-474","source":"Crossref","is-referenced-by-count":4,"title":["The use of a synchronizer yields the maximum computation rate in distributed networks"],"prefix":"10.1007","volume":"30","author":[{"given":"S.","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,30]]},"reference":[{"issue":"4","key":"BF02679457_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, Complexity of Network Synchronization,J. Assoc. Comput. Mach., Vol. 32, No. 4, Oct. 1985, pp. 804\u2013823.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"BF02679457_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","volume":"15","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, Reducing Complexities of Distributed Maximum Flow and Breadth-First Search Algorithms by Means of Network Synchronization,Networks, Vol. 15, No. 4, Winter 1985, pp. 425\u2013437.","journal-title":"Networks"},{"key":"BF02679457_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, M. Sipser, Dynamic Networks are as Fast as Static Networks, inProc. 29th IEEE Symp. on Foundations of Computer Science, Oct. 1988, pp. 206\u2013220.","DOI":"10.1109\/SFCS.1988.21938"},{"key":"BF02679457_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A. Brauer","year":"1942","unstructured":"A. Brauer, On a Problem of Partitions,Amer. J. Math., Vol. 64, 1942, pp. 299\u2013312.","journal-title":"Amer. J. Math."},{"issue":"4","key":"BF02679457_CR5","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V.C. Barbosa","year":"1989","unstructured":"V.C. Barbosa, E. Gafni, Concurrency in Heavily Loaded Neighborhood-Constrained Systems,ACM Trans. Programming Languages and Systems, Vol. 11, No. 4, Oct. 1989, pp. 562\u2013584.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"BF02679457_CR6","series-title":"Research Report","volume-title":"Synchronizing Asynchronous Bounded-Delay Networks","author":"C.T. Chou","year":"1986","unstructured":"C.T. Chou, I.S. Gopal, S. Zaks, Synchronizing Asynchronous Bounded-Delay Networks, Research Report RC-12274, IBM, Yorktown Heights, NY, Oct. 1986."},{"issue":"5","key":"BF02679457_CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"F. Commoner, A.W. Holt, S. Even, A. Pnueli, Marked Directed Graphs,J. Comput. System Sci., Vol. 5, No. 5, Oct. 1971, pp. 511\u2013523.","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"BF02679457_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K.M. Chandy","year":"1985","unstructured":"K.M. Chandy and L. Lamport, Distributed Snapshots: Determining Global States of Distributed Systems,ACM Trans. Comput. Systems, Vol. 3, No. 1, Feb. 1985, pp. 63\u201375.","journal-title":"ACM Trans. Comput. Systems"},{"issue":"5","key":"BF02679457_CR9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01185865","volume":"28","author":"S. Even","year":"1995","unstructured":"S. Even, S. Rajsbaum, Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer,Math. Systems Theory, Vol. 28, No. 5, 1995, pp. 421\u2013435.","journal-title":"Math. Systems Theory"},{"key":"BF02679457_CR10","doi-asserted-by":"crossref","unstructured":"A. Fekete, N. Lynch, L. Shrira, A Modular Proof of Correctness for a Network Synchronizer,Proc. 2nd Workshop on Distributed Algorithms, CWI, July 1987, pp. 219\u2013256.","DOI":"10.1007\/BFb0019807"},{"key":"BF02679457_CR11","volume-title":"Einfache Nicht-Sequentielle Prozesse","author":"H.J. Genrich","year":"1970","unstructured":"H.J. Genrich,Einfache Nicht-Sequentielle Prozesse, Gesellschaft fur Mathematik und Datenverarbeitung, Birlinghoven, 1970."},{"key":"BF02679457_CR12","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1968","unstructured":"G.H. Hardy, E.M. Wright,An Introduction to the Theory of Numbers, 4th edn., 1968, Oxford University Press, Oxford.","edition":"4th edn."},{"key":"BF02679457_CR13","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, A Characterization of the Minimum Cycle Mean in a Digraph,Discrete Math., Vol. 23, 1978, pp. 309\u2013311.","journal-title":"Discrete Math."},{"key":"BF02679457_CR14","first-page":"213","volume-title":"Sequential Machines","author":"E.F. Moore","year":"1964","unstructured":"E.F. Moore, The Firing Squad Synchronization Problem, inSequential Machines, Selected Papers, Addison-Wesley, Reading, MA, 1964, pp. 213\u2013214."},{"key":"BF02679457_CR15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01769705","volume":"10","author":"Y. Malka","year":"1994","unstructured":"Y. Malka, S. Moran, S. Zaks, A Lower Bound on the Period Length of a Distributed Scheduler,Algorithmica, Vol. 10, 1994, pp. 383\u2013398.","journal-title":"Algorithmica"},{"key":"BF02679457_CR16","first-page":"242","volume-title":"Proc. 5th Internat. Workshop on Distributed Algorithms","author":"Y. Malka","year":"1991","unstructured":"Y. Malka, S. Rajsbaum, Analysis of Distributed Algorithms Based on Recurrence Relations, inProc. 5th Internat. Workshop on Distributed Algorithms, Delphi, Oct. 7\u20139, S. Toueget al. (eds.), LNCS, Vol. 579, Springer-Verlag, Berlin, 1991, pp. 242\u2013253."},{"issue":"2","key":"BF02679457_CR17","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg, J. Ullman, An Optimal Synchronizer for the Hypercube,SIAM J. Comput., Vol. 18, No. 2, 1989, pp. 740\u2013747.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"BF02679457_CR18","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R. Reiter","year":"1968","unstructured":"R. Reiter, Scheduling Parallel Computations,J. Assoc. Comput. Mach., Vol. 15, No. 4, Oct. 1968, pp. 590\u2013599.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"9","key":"BF02679457_CR19","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/71.308532","volume":"5","author":"S. Rajsbaum","year":"1994","unstructured":"S. Rajsbaum, M. Sidi, On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays,IEEE Trans. Parallel Distrib. Systems, Vol. 5, No. 9, Sept. 1994, pp. 939\u2013950.","journal-title":"IEEE Trans. Parallel Distrib. Systems"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02679457\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T11:40:47Z","timestamp":1558352447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02679457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":19,"aliases":["10.1007\/s002240000062"],"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["BF02679457"],"URL":"https:\/\/doi.org\/10.1007\/bf02679457","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}