{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:11Z","timestamp":1725455711053},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020434","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"194-208","source":"Crossref","is-referenced-by-count":1,"title":["Local labeling and resource allocation using preprocessing"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"15_CR1","unstructured":"H. Attiya, M. Bellare, H. Shachnai and T. Tamir. The minimum color sum problem and distributed resource allocation, manuscript, 1994."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and D. Peleg. Sparse partition. IEEE Symp. on Foundation of Computer Science, 1990, pp. 503\u2013513.","DOI":"10.1109\/FSCS.1990.89571"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. IEEE Syrnp. on Foundation of Computer Science, 1990, pp. 65\u201374.","DOI":"10.1109\/FSCS.1990.89525"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V.C. Barbosa","year":"1989","unstructured":"V.C. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood constrained systems. ACM Trans. Programming Languages and Systems, Vol. 11, 1989, pp. 562\u2013584.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Peleg. Distributed resource allocation algorithms. International Workshop on Distributed Algorithms, 1992, pp. 276\u2013291.","DOI":"10.1007\/3-540-56188-9_19"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K. Chandy","year":"1984","unstructured":"K. Chandy and J. Misra. The drinking philosophers problem. ACM Trans. Programming Languages and Systems, Vol. 6, 1984, pp. 632\u2013646.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"M. Choy and A. K. Singh. Efficient fault tolerant algorithms in distributed systems. Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 593\u2013602.","DOI":"10.1145\/129712.129770"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u00f6s","year":"1959","unstructured":"P. Erd\u00f6s, Graph theory and probability. Canad. J.Math., 11, pp. 34\u201338, 1959.","journal-title":"Canad. J.Math."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"A. Goldberg, S. Plotkin and G. Shannon. Parallel symmetry-breaking in sparse graphs. Proc. 19th ACM Symposium on Theory of Computing, 1987, pp. 315\u2013324.","DOI":"10.1145\/28395.28429"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"N. Linial. Distributive algorithms \u2014 Global solutions from local data. IEEE Symp. on Foundation of Computer Science, 1987. pp. 331\u2013335.","DOI":"10.1109\/SFCS.1987.20"},{"key":"15_CR11","volume-title":"Technical Report No. 9","author":"N. Linial","year":"1993","unstructured":"N. Linial. Local-Global phenomena in graphs. Technical Report No. 9, 1993 Hebrew University, Jerusalem, Israel."},{"key":"15_CR12","unstructured":"N. Linial and M. Saks. Decomposing graphs into regions of small diameter. SIAM-ACM Symposium on Discrete Algorithms, 1991, pp. 320\u2013330."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"M. Naor and L. Stockmayer. What can be computed locally? 25th ACM Symposium on Theory of Computing, 1993, pp. 184\u2013193.","DOI":"10.1145\/167088.167149"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"A. Panconesi and A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems. 24th ACM Symposium on Theory of Computing, 1992, pp. 581\u2013592.","DOI":"10.1145\/129712.129769"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"M. Szegendy and S. Vishwanathan. Locality based graph coloring. 25th ACM Symposium on Theory of Computing, 1993, pp. 201\u2013207.","DOI":"10.1145\/167088.167156"},{"key":"15_CR16","volume-title":"Ph.D Thesis","author":"I. Rhee","year":"1994","unstructured":"I. Rhee. Efficiency of partial synchrony, and resource allocation in distributed systems, Ph.D Thesis, University of North Carolina at Chapel Hill, June 1994."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:05Z","timestamp":1586551565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0020434","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}