{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:10Z","timestamp":1749944410097,"version":"3.41.0"},"reference-count":15,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1995]]},"DOI":"10.1051\/ita\/1995290503831","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:19:23Z","timestamp":1486048763000},"page":"383-400","source":"Crossref","is-referenced-by-count":1,"title":["Token transfer in a faulty network"],"prefix":"10.1051","volume":"29","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Malinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","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":"1. BERMAN K. A. and HAWRYLYCZ M., Telephone problems with failures, SIAM J. Alg. Disc. Meth., 1986, 7, pp. 13-17.8197010578.05059","DOI":"10.1137\/0607002"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BIENSTOCK D., Broadcasting with random faults, Disc. Appl. Math., 1988, 20, pp. 1-7.9368930658.05068","DOI":"10.1016\/0166-218X(88)90037-6"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BITAN S. and ZAKS S., Optimal linear broadcast, J. of Algorithms, 1993, 14, pp. 288-315.12019300774.68014","DOI":"10.1006\/jagm.1993.1015"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. CHLEBUS B. S., DIKS K. and PELC A., Sparse networks supporting efficient reliable broadcasting, Proc. of the 20th International Colloquium on Automata, Languages and Programming, ICALP-93, LNCS 700, pp. 388-397.0817.68019","DOI":"10.1007\/3-540-56939-1_88"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. CHLEBUS B. S., DIKS K. and PELC A., Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS-21, 1991, pp. 266-273.","DOI":"10.1109\/FTCS.1991.146672"},{"key":"R6","unstructured":"6. CHLEBUS B. S., DIKS K. and PELC A., Fast gossiping with short unreliable messages, Disc. Appl. Math., to appear.12909990807.94029"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. CHLEBUS B. S., DIKS K. and PELC A., Waking up an anonymous faulty network from a single source, Proc. of the 27th Annual Hawaii International Conference on System Sciences, 1994, Vol. 2, pp. 187-193.1259015","DOI":"10.1109\/HICSS.1994.323266"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. CHOU C.-T. and GOPAL I. S., Linear broadcast routing, J. of Algorithms, 1989, 10, pp. 490-517.10221080825.68415","DOI":"10.1016\/0196-6774(89)90002-3"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. DIKS K. and PELC A., Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math., 1992, 5, pp. 338-344.11727420768.05060","DOI":"10.1137\/0405025"},{"key":"R10","unstructured":"10. DIKS K. and PELC A., Linear time gossiping with random faults, Rapport de Recherche RR 93\/02-3, Universit\u00e9 du Qu\u00e9bec \u00e0 Hull, 1993.0803.68004"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. GARGANO L., Tighter time bounds on fault-tolerant broadcasting and gossiping, Networks, 1992, 22, pp. 469-486.11709490758.90033","DOI":"10.1002\/net.3230220505"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. HADDAD R. W., ROY S. and SCHAFFER A. A., On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth., 1987, 8, pp. 439-445.8977410626.05033","DOI":"10.1137\/0608036"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. HAGERUP T. and RUB C., A guided tour of Chernoff bounds, Inf. Proc. Letters, 1989\/90, 33, pp. 305-308.10455200702.60021","DOI":"10.1016\/0020-0190(90)90214-I"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. HEDETNIEMI S. M., HEDETNIEMI S. T. and LIESTMAN 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":"R15","doi-asserted-by":"crossref","unstructured":"15. SCHEINERMAN E. R. and WIERMAN J. C., Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math., 1989, 25, pp. 289-29710263380709.05031","DOI":"10.1016\/0166-218X(89)90007-3"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1995290503831\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:18:33Z","timestamp":1749943113000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1995290503831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":15,"journal-issue":{"issue":"5"},"alternative-id":["ita1995290503831"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1995290503831","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[1995]]}}}