{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:03:17Z","timestamp":1649178197341},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> An unrestricted supply of identical tokens is stored in one node of an n-node network, called the source. In a unit of time each node of the network that holds tokens can send at most one token to at most one other node. Links and\/or nodes of the network fail independently with constant probability. An attempt to send a token to a faulty node or via a faulty link does not succeed (the token remains at the sending node). The aim of token dispersal is to visit every fault-free node by at least one token. We present token dispersal algorithms with optimal order of time complexity and probability of correctness exceeding 1\u22121\/n. <\/jats:p>","DOI":"10.1142\/s0129626494000387","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"417-427","source":"Crossref","is-referenced-by-count":1,"title":["RELIABLE TOKEN DISPERSAL WITH RANDOM FAULTS"],"prefix":"10.1142","volume":"04","author":[{"given":"KRZYSZTOF","family":"DIKS","sequence":"first","affiliation":[{"name":"Instytut Informatyki, Universytet Warszawski, Banacha 2, 02\u2013097 Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ADAM","family":"MALINOWSKI","sequence":"additional","affiliation":[{"name":"Instytut Informatyki, Universytet Warszawski, Banacha 2, 02\u2013097 Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDRZEJ","family":"PELC","sequence":"additional","affiliation":[{"name":"Departement d\u2019Informatique,  Universit\u00e9 du Qu\u00e9bec \u00e0 Hull C.P. 1250, succ. \u201cB\u201d,  Hull, Qu\u00e9bec J8X 3X7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626494000387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:31:42Z","timestamp":1565184702000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626494000387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S0129626494000387"],"URL":"https:\/\/doi.org\/10.1142\/s0129626494000387","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}