{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T11:28:14Z","timestamp":1790854094201,"version":"4.1.0"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1989,8]]},"abstract":"<jats:p>The synchronizer is a simulation methodology introduced by Awerbuch [J. Assoc. Comput. Math., 32 (1985), pp. 804\u2013823] for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. In this paper a novel technique for constructing network synchronizers is presented. This technique is developed from some basic relationships between synchronizers and the structure of a t-spanning subgraph over the network. As a special result, a synchronizer for the hypercube with optimal time and communication complexities is obtained.<\/jats:p>","DOI":"10.1137\/0218050","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:32:44Z","timestamp":1109226764000},"page":"740-747","source":"Crossref","is-referenced-by-count":212,"title":["An Optimal Synchronizer for the Hypercube"],"prefix":"10.1137","volume":"18","author":[{"given":"David","family":"Peleg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RA1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"RA2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150404"},{"key":"RA3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch,  Communication-time trade-offs in network synchronization,  Proc. 4th ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada,  1985,  272\u2013276","DOI":"10.1145\/323596.323621"},{"key":"RGHS","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"RH","volume-title":"A first course in coding theory","author":"Hill Raymond","year":"1986"},{"key":"RP","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674863"},{"key":"RPS","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"RPU","doi-asserted-by":"crossref","unstructured":"D. Peleg, E. Upfal,  A tradeoff between space and efficiency for routing tables,  Proc. 20th Annual ACM Symposium on Theory of Computing,  1988,  43\u201352","DOI":"10.1145\/62212.62217"},{"key":"RU","volume-title":"Computational Aspects of VLSI","author":"Ullman J. D.","year":"1984"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0218050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:44:32Z","timestamp":1787337872000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0218050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["10.1137\/0218050"],"URL":"https:\/\/doi.org\/10.1137\/0218050","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}