{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:53Z","timestamp":1725455393867},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019802","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"155-166","source":"Crossref","is-referenced-by-count":3,"title":["How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion"],"prefix":"10.1007","author":[{"given":"Naimi","family":"Mohamed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trehel","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"13_CR1","unstructured":"A. Arnold, M.P. Delest, S. Dulucq, \"Complexit\u00e9 moyenne de l'algorithme d'exclusion mutuelle de NAIMI-TREHEL,\" Rapport de recherche No1 87-14 Universit\u00e9 de Bordeaux 1, (1987)."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TC.1982.1675885","volume":"C-31","author":"H. Garcia-Molina","year":"1982","unstructured":"H. Garcia-Molina, \"Elections in a distributed computing system,\" IEEE Trans. On Com. Vol. C-31, (Jan. 1982), pp. 48\u201359.","journal-title":"IEEE Trans. On Com."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/2993.2994","volume":"6","author":"L. Lamport","year":"1984","unstructured":"L. Lamport, \"Using time instead of timeout for fault-tolerant distributed systems,\" ACM TOPLAS, Vol. 6, No. 2, (April 1984), pp. 254\u2013280.","journal-title":"ACM TOPLAS"},{"key":"13_CR4","unstructured":"M. Naimi, \"Une structure arborescente pour une classe d'algorithmes distribu\u00e9s d'exclusion mutuelle,\" Th\u00e8se de l'universit\u00e9 de Besan\u00e7on, 1987"},{"key":"13_CR5","unstructured":"M. Raynal, \"Syst\u00e8mes R\u00e9partis et R\u00e9seaux, concepts outils et algorithmes,\" Eyrolles 1987."},{"issue":"2","key":"13_CR6","first-page":"141","volume":"6","author":"M. Trehel","year":"1987","unstructured":"M. Trehel, M. Naimi, \"Un algorithme distribu\u00e9 d'exclusion mutuelle en Log(n),\" TSI Vol. 6, no 2, (1987), pp. 141\u2013150.","journal-title":"TSI"},{"key":"13_CR7","unstructured":"M. Trehel, M. Naimi, \"A distributed algorithm for mutual exclusion based on data structures and fault tolerance,\" IEEE Phoenix Conference on Computers and Communications. Phoenix, Arizona, (Feb. 1987), pp. 35\u201339."},{"key":"13_CR8","unstructured":"M. Trehel \"Propri\u00e9t\u00e9s des nombres harmoniques Hn li\u00e9es \u00e0 des transformations d'arborescences,\" Rapport de recherche L.I., Universit\u00e9 de Besan\u00e7on, (Sep. 1986)."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T11:03:27Z","timestamp":1549278207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0019802","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}