{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:10Z","timestamp":1725664990001},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617693"},{"type":"electronic","value":"9783540706793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:21:42Z","timestamp":1330294902000},"page":"220-233","source":"Crossref","is-referenced-by-count":2,"title":["Maintaining a dynamic set of processors in a distributed system"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. Optimal distributed algorithms for minimal weight spanning tree, counting, leader election and related problems. In Proc. 19th STOC, pages 230\u2013240. ACM, 1987.","DOI":"10.1145\/28395.28421"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"J. M. Bernab\u00e9u-Aub\u00e1n and M. Ahamad. Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm. In Proc. 3rd WDAG (LNCS 392), pages 33\u201344, 1989.","DOI":"10.1007\/3-540-51687-5_30"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"F. Chin and H. F. Ting. An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees. In Proc. 26th FOCS, pages 257\u2013266. IEEE, 1985.","DOI":"10.1109\/SFCS.1985.7"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"R. J. Fowler. The complexity of using forwarding addresses for decentralized object finding. In Proc. 5th PODC, pages 108\u2013120. ACM, 1986.","DOI":"10.1145\/10590.10600"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning tree. In ACM Transactions on Programming Languages and Systems 5, 1 66\u201377, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0020-0190(89)90101-4","volume":"31","author":"D. Ginat","year":"1989","unstructured":"D. Ginat, D. D. Sleator, and R. E. Tarjan. A tight amortized bound for path traversal. Information Processing Letters, 31:3\u20135, April 1989.","journal-title":"Information Processing Letters"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02242717","volume":"8","author":"G. Singh","year":"1995","unstructured":"G. Singh and A. J. Bernstein. A highly asynchronous minimum spanning tree protocol. Distributed Computing, 8:151\u2013161, 1995.","journal-title":"Distributed Computing"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"M. M. Theimer and K. A. Lantz. Finding idle machines in a workstation-based distributed system. In Proc. 8th ICDCS, pages 112\u2013122, IEEE, 1988.","DOI":"10.1109\/DCS.1988.12508"},{"key":"15_CR10","unstructured":"M. Trehel and M. Naimi. A distributed algorithm for mutual exclusion based on data structures and fault tolerance. In Proc. 6th Annual Phoenix Conf. on Computers and Communications, pages 35\u201339. IEEE, 1987."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"T.-K. Woo. Huffman trees as a basis for a dynamic mutual exclusion algorithm for distributed systems. In Proc. 12th IEEE Int. Conf. on Distr. Comp. Sys., pages 126\u2013133. IEEE, 1992.","DOI":"10.1109\/ICDCS.1992.235047"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:28Z","timestamp":1605647428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}