{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:37:16Z","timestamp":1649090236246},"reference-count":17,"publisher":"EDP Sciences","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1994]]},"DOI":"10.1051\/ita\/1994283-403031","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:38:56Z","timestamp":1486049936000},"page":"303-342","source":"Crossref","is-referenced-by-count":7,"title":["The complexity of systolic dissemination of information in interconnection networks"],"prefix":"10.1051","volume":"28","author":[{"given":"J.","family":"Hromkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Unger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Wagener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[BHMS90] BAGCHI A., HAKIMI S. L., MITCHEM J. and SCHMEICHEL E., Parallel algorithms for gossiping by mail, Information, Process. Letters, 1990, 34, pp. 197-202.10604350696.68048","DOI":"10.1016\/0020-0190(90)90160-Y"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[CC84] CHOFFRUT C. and CULIK II K., On real-time cellular automata and trellis automata, Acta Informatica, 1984, 21, pp. 393-407.7673160534.68039","DOI":"10.1007\/BF00264617"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[CGS83] CULIK II K., GRUSKA J. and SALOMAA A., Systolic automata for VLSI on balanced trees, Acta Informatica, 1983, 18, pp. 335-344.6917330493.68054","DOI":"10.1007\/BF00289573"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[CGS84] CULIK II K., GRUSKA J. and SALOMAA A., Systolic trellis automata. Part I, Intern. J. Comput. Math., 1984, 15, pp. 195-212.7542660571.68041","DOI":"10.1080\/00207168408803410"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"[CSW84] CULIK II K., SALOMAA A. and WOOD D., Systolic tree acceptors, R.A.I.R.O. Theoretical Informatics, 1984, 18, pp. 53-69.922007504510571.68043","DOI":"10.1051\/ita\/1984180100531"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[FHMMM92] FELDMANN R., HROMKOVI\u010c J., MADHAVAPEDDY S., MONIEN B. and MYSLIWIETZ P., Optimal algorithms for dissemination of information in generalized communication modes, Proc. PARLE'92, Springer-Verlag, Lecture Notes in Computer Science, 1992, 605, pp. 115-130.0823.680411230238","DOI":"10.1007\/3-540-55599-4_84"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[HHL88] HEDETNIEMI S. M., HEDETNIEMI S. T. and LIESTMANN A. L., A survey of gossiping and broadcasting in communication networks, Networks, 1988, 18, pp. 319-349.9642360649.90047","DOI":"10.1002\/net.3230180406"},{"key":"R8","unstructured":"[HJM93] HROMKOVI\u010c J., JESCHKE C.-D. and MONIEN B., Note an optimal gossiping in some weak-connected graphs, Theoretical Computer Science (to appear).12758250824.68010"},{"key":"R9","unstructured":"[HKMP93] HROMKOVI\u010c J., KLASING R., MONIEN B. and PEINE R., Dissemination of information in interconnection networks (broadcasting & gossiping), In Combinatorial Network Theory (Frank Hsu, Ding-Zhu Du, Eds), Science Press, AMS 1993 (to appear).13828710840.68088"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[IK84] IBARRA O. H. and KIM S. M., Characterizations and computational complexity of systolic trellis automata, Theoretical Computer Science, 1984, 29, pp. 123-153.7424050536.68048","DOI":"10.1016\/0304-3975(84)90015-X"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"[IKM85] IBARRA O. H., KIM S. M. and MORAN S., Sequential machine characterizations of trellis and cellular automata and applications, SIAM J. Comput., 1985, 14, pp. 426-447.7847480574.68044","DOI":"10.1137\/0214033"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[IPK85] IBARRA O. H., PALIS M. A. and KIM S. M., Fast parallel language recognition by cellular automata, Theoretical Computer Science, 1985, 41, pp. 231-246.8476790591.68054","DOI":"10.1016\/0304-3975(85)90073-8"},{"key":"R13","unstructured":"[Ku79] KUNG H. T., Let's design algorithms for VLSI systems, In Proc. of the Caltech Conference of VLSI (CL. L. Seifz Ed.), Pasadena, California, 1979, pp. 65-90."},{"key":"R14","unstructured":"[LHL93] LABAHN R., HEDETNIEMI S. T. and LASKAR R., Periodic gossiping on trees, in Discrete Applied Mathematics (to appear).12910100836.68085"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"[LR93a] LIESTMAN A. L. and RICHARDS D., Perpetual gossiping, Technical Report, Simon Fraser University, Vancouver, Canada, 1993.1279556","DOI":"10.1007\/3-540-57568-5_256"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"[LR93b] LIESTMAN A. L. and RICHARDS D., Network communication in edge-colored graphs: Gossiping, IEEE Trans. Par. Distr. Syst., 1993, 4, pp. 438-445.","DOI":"10.1109\/71.219758"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"[MS90] MONIEN B. and SUDBOROUGH I. H., Embedding one interconnection network in another, Computing Suppl., 1990, 7, pp. 257-282.10599340699.68017","DOI":"10.1007\/978-3-7091-9076-0_13"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1994283-403031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:04:52Z","timestamp":1568786692000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1994283-403031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":17,"journal-issue":{"issue":"3-4"},"alternative-id":["ita1994283-403031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1994283-403031","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}