{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:22Z","timestamp":1759638442339,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/ipdps.2006.1639282","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T15:59:56Z","timestamp":1152547196000},"page":"10 pp.","source":"Crossref","is-referenced-by-count":1,"title":["Distributed algorithm for a color assignment on asynchronous rings"],"prefix":"10.1109","author":[{"given":"G.","family":"De Marco","sequence":"first","affiliation":[]},{"given":"M.","family":"Leoncini","sequence":"additional","affiliation":[]},{"given":"M.","family":"Montangero","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Processor Allocation Based on Weighted Bipartite Matching Scheduling","year":"0","author":"silk","key":"15"},{"key":"16","first-page":"149","article-title":"Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications","author":"stoica","year":"2001","journal-title":"Proceedings of the 2001 ACM SIGCOMM Conference"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90040-3"},{"journal-title":"Distributed Algorithms","year":"1996","author":"lynch","key":"11"},{"year":"0","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(88)90063-9"},{"key":"2","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0377-2217(97)00008-8","article-title":"The ?-assignment Problems","volume":"104","author":"chang","year":"1998","journal-title":"Eur J Oper Res"},{"key":"1","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/71.877834","article-title":"An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable Computing Cluster","volume":"11","author":"amir","year":"2000","journal-title":"IEEE Trans on Parallel and Distributed Systems"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301360"},{"key":"6","first-page":"219","article-title":"On the distributed complexity of computing maximal matchings","author":"hanckoviak","year":"1998","journal-title":"SODA '98 Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90023-2"},{"article-title":"Scalable source routing - protocol specification, version 1.0","year":"2005","author":"cramer","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"}],"event":{"name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","start":{"date-parts":[[2006,4,25]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2006,4,29]]}},"container-title":["Proceedings 20th IEEE International Parallel & Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10917\/34366\/01639282.pdf?arnumber=1639282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T03:22:56Z","timestamp":1497669776000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1639282\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2006.1639282","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}