{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:55:47Z","timestamp":1648670147721},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,12,21]],"date-time":"2005-12-21T00:00:00Z","timestamp":1135123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00446-005-0149-0","type":"journal-article","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T09:26:06Z","timestamp":1135243566000},"page":"409-420","source":"Crossref","is-referenced-by-count":6,"title":["Distributed scheduling for disconnected cooperation"],"prefix":"10.1007","volume":"18","author":[{"given":"Grzegorz","family":"Malewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,12,21]]},"reference":[{"key":"149_CR1","unstructured":"Dolev, S., Segala, R., Shvartsman, A.A.: Dynamic load balancing with group communication. In: Proceedings of Intl Colloquium on Structural Information and Communication Complexity, pp. 111\u2013125 (1999)"},{"issue":"4","key":"149_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/227210.227227","volume":"39","author":"D. Dolev","year":"1996","unstructured":"Dolev, D., Malki, D.: The transis approach to high availability cluster communications. Commun. ACM 39(4), 64\u201370 (1996)","journal-title":"Commun. ACM"},{"key":"149_CR3","doi-asserted-by":"crossref","unstructured":"Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M.: SETI@home: Massively distributed computing for SETI. In: Dubois, P.F. (ed.) Computing in Science and Engineering. IEEE Computer Society Press, Los Alamitos, CA (2000)","DOI":"10.1109\/5992.895191"},{"key":"149_CR4","doi-asserted-by":"crossref","unstructured":"Kondo, D., Casanova, H., Wing, E., Berman, F.: Models and scheduling guidelines for global computing applications. In: proceedings of International Parallel and Distributed Processing Symposium, p. 79 (2002)","DOI":"10.1109\/IPDPS.2002.1015590"},{"key":"149_CR5","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the value of information in distributed decision-making. In: Proceedings of ACM Symposium on Principles of Distibuted Computing, pp. 61\u201364 (1991)","DOI":"10.1145\/112600.112606"},{"key":"149_CR6","doi-asserted-by":"crossref","unstructured":"Georgiades, S., Mavronicolas, M., Spirakis, P.: Optimal, distributed decision-making: The case of no communication. In: Proceedings of International Symposium on Fundamentals of Computation Theory, pp. 293\u2013303 (1999)","DOI":"10.1007\/3-540-48321-7_24"},{"issue":"4","key":"149_CR7","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1137\/S0097539704440442","volume":"34","author":"Ch. Georgiou","year":"2005","unstructured":"Georgiou, Ch., Russell, A., Shvartsman, A.: Work-competitive scheduling for cooperative computing with dynamic groups. SIAM J. Comput. 34(4), 848\u2013862 (2005)","journal-title":"SIAM J. Comput."},{"key":"149_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566066","volume-title":"Design Theory","author":"D.R. Hughes","year":"1985","unstructured":"Hughes, D.R., Piper, F.C.: Design Theory. Cambridge University Press, New York (1985)"},{"key":"149_CR9","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (1992). With an Appendix by Paul Erd\u0151s, Wiley-Interscience"},{"key":"149_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"149_CR11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K. Azuma","year":"1967","unstructured":"Azuma, K.: Weighted sums of certain dependent random variables. T\u00f4hoku Math. J. 19(2), 357\u2013367 (1967)","journal-title":"T\u00f4hoku Math. J."},{"key":"149_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","volume":"8","author":"S.M. Johnson","year":"1962","unstructured":"Johnson, S.M.: A new upper bound for error-correcting codes. IEEE Trans. Inf. Theor. 8, 203\u2013207 (1962)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"149_CR13","unstructured":"Dudley, R.M.: Real Analysis and Probability. Wadsworth & Brooks\/Cole Advanced Books & Software. Pacific Grove (1989)"},{"key":"149_CR14","volume-title":"Graph Theory","author":"F. Harary","year":"1994","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading, MA (1994)"},{"issue":"4","key":"149_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp., R.M.: A O(n5\/2) algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"149_CR16","unstructured":"Malewicz, G.: Distributed scheduling for disconnected cooperation. Doctoral Dissertation, University of Connecticut (2003)"},{"key":"149_CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0012-365X(00)00332-0","volume":"231","author":"J.P. Morgan","year":"2001","unstructured":"Morgan, J.P., Preece, D.A., Rees, D.H.: Nested balanced incomplete block designs. Discrete Math. 231, 351\u2013389 (2001)","journal-title":"Discrete Math."},{"key":"149_CR18","unstructured":"Malewicz, G.: Latin squares with bounded size of row prefix intersections. Discrete Applied Math. (2004)"},{"key":"149_CR19","volume-title":"Latin Squares and their Applications","author":"J. Denes","year":"1974","unstructured":"Denes, J., Keedwell, A.D.: Latin Squares and their Applications. Academic, New York (1974)"},{"key":"149_CR20","doi-asserted-by":"crossref","unstructured":"Malewicz, G.: Toward a theory of avalanche-creating and error-controlling encoding schemes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT\u201905), pp. 2394\u20132398 (2005)","DOI":"10.1109\/ISIT.2005.1523777"},{"issue":"5","key":"149_CR21","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Halpern, J., Waarts, O.: Performing work efficiently in the presence of faults. SIAM J. Comput. 27(5), 1457\u20131491 (1998)","journal-title":"SIAM J. Comput."},{"key":"149_CR22","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Russell, A., Shvartsman, A.: Local scheduling for distributed cooperation. In: Proceedings of IEEE International Symposium on Network Computing and Applications, NCA\u201901, pp. 244\u2013255 (2001)","DOI":"10.1109\/NCA.2001.962540"},{"key":"149_CR23","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Russell, A., Shvartsman, A.A.: Optimal scheduling for disconnected cooperation. In: Proceedings of 8th International Colloquium on Structural Information and Communication Complexity (2001) (also see brief announcement in PODC\u201901)","DOI":"10.1145\/383962.384048"},{"key":"149_CR24","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed cooperation during the absence of communication. In: Proceedings of 14th International Conference on Distributed Computing, LNCS, vol. 1914, pp. 119\u2013133 (2000) (also see brief announcement in PODC\u201900)","DOI":"10.1007\/3-540-40026-5_8"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0149-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0149-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0149-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T18:59:45Z","timestamp":1586631585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0149-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,21]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0149-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,21]]}}}