{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T18:22:23Z","timestamp":1746728543046},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:13:00Z","timestamp":1330204380000},"page":"33-44","source":"Crossref","is-referenced-by-count":12,"title":["Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 M.","family":"Bernab\u00e9u-Aub\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustaque","family":"Ahamad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"4_CR1","volume-title":"Algorithms for Mutual Exclusion. Series in Computer Systems","author":"M. Raynal","year":"1986","unstructured":"M. Raynal, Algorithms for Mutual Exclusion. Series in Computer Systems, Cambridge, Massachussets: MIT Press, 1st ed., 1986. Translated by D. Beeson.","edition":"1st ed."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","volume":"5","author":"B. A. Sanders","year":"1987","unstructured":"B. A. Sanders, \u201cThe information structure of distributed mutual exclusion algorithms,\u201d ACM Trans. Computer Systems, vol. 5, pp. 284\u2013299, August 1987.","journal-title":"ACM Trans. Computer Systems"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \u201cTime, clocks and the ordering of events in a distributed system,\u201d Communications ACM, vol. 21, pp. 558\u2013565, July 1978.","journal-title":"Communications ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"G. Ricart and A. K. Agrawala, \u201cAn optimal algorithm for mutual exclusion in computer networks,\u201d Communications ACM, vol. 24, pp. 9\u201317, January 1981.","journal-title":"Communications ACM"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"M. Maekawa, \u201cA \u221aN algorithm for mutual exclusion in decentralized systems,\u201d ACM Trans. Computer Systems, vol. 3, pp. 145\u2013159, May 1985.","journal-title":"ACM Trans. Computer Systems"},{"key":"4_CR6","unstructured":"M. Singhal, \u201cA dynamic information-structure mutual exclusion algorithm for distributed systems,\u201d Tech. Rep., Department of Computer and Information Science. The Ohio State University, 1988."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I. Suzuki","year":"1985","unstructured":"I. Suzuki and T. Kasami, \u201cA distributed mutual exclusion algorithm,\u201d ACM Trans. Computer Systems, vol. 3, pp. 344\u2013349, November 1985.","journal-title":"ACM Trans. Computer Systems"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/358024.940975","volume":"26","author":"O. Carvalho","year":"1983","unstructured":"O. Carvalho and G. Roucairol, \u201cOn mutual exclusion in computer networks,\u201d Communications ACM, vol. 26, pp. 146\u2013147, February 1983.","journal-title":"Communications ACM"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D. Agrawal and A. El Abbadi, \u201cAn efficient solution to the distributed mutual exclusion problem,\u201d Tech. Rep., Department of Computer Science. University of California at Santa Barbara, 1988.","DOI":"10.1145\/72981.72994"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"K. Raymond, \u201cA tree-based algorithm for distributed mutual exclusion,\u201d ACM Trans. Computer Systems, vol. 7, pp. 61\u201377, February 1989.","journal-title":"ACM Trans. Computer Systems"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01667083","volume":"2","author":"J. L. Snepscheut van de","year":"1987","unstructured":"J. L. van de Snepscheut, \u201cFair mutual exclusion on a graph of processes,\u201d Distributed Computing, vol. 2, pp. 113\u2013115, 1987.","journal-title":"Distributed Computing"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"S. J. Mullender and P. M. Vit\u00e1ny, \u201cDistributed match-making,\u201d Algorithmica, no. 3, pp. 367\u2013391, 1988.","DOI":"10.1007\/BF01762123"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"M. Powell and B. Miller, \u201cProcess migration in DEMOS\/MP,\u201d in Proceedings Of the 9th Symposium on Operating System Principles. (Breton Woods, N.H.), pp. 110\u2013119, ACM, October 10\u201313 1983.","DOI":"10.1145\/800217.806619"},{"key":"4_CR14","unstructured":"R. Fowler, \u201cDecentralized object finding using forwarding addresses,\u201d PhD Thesis 85-12-1, University of Washington, December 1985."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"N. A. Lynch and M. R. Tuttle, \u201cHierarchical correctness proofs for distributed algorithms,\u201d in Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pp. 137\u2013151, ACM SIGACT and ACM SIGOPS, ACM Press, August 1987.","DOI":"10.1145\/41840.41852"},{"key":"4_CR16","unstructured":"J. M. Bernab\u00e9u-Aub\u00e1n and M. Ahamad, \u201cModeling an efficient mutual exclussion algorithm for distributed systems,\u201d Tech. Rep. GIT-ICS-89\/18, School of Information and Computer Science, Georgia Institute of Technology, ATLANTA, GA 30332, April 1989."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/0214010","volume":"14","author":"A. C. Yao","year":"1985","unstructured":"A. C. Yao, \u201cOn the expected performance of path compression algorithms,\u201d SIAM Journal on Computing, vol. 14, pp. 129\u2013133, February 1985.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR18","unstructured":"M. Paterson, \u201c,\u201d 1972. MIT class notes for course 6.851J, by A.R. Meyer and M.J. Fischer, 1973."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:28Z","timestamp":1605648148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}