{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:50Z","timestamp":1725570710916},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_31","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"427-442","source":"Crossref","is-referenced-by-count":0,"title":["On the Message Complexity of Global Computations"],"prefix":"10.1007","author":[{"given":"Doron","family":"Nussbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: A new distributed depth-first search algorithm. Information Processing Letters\u00a020, 147\u2013150 (1985)","journal-title":"Information Processing Letters"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/77600.77618","volume":"37","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A Trade-off between Information and Communication in Broadcast Protocols. Journal of the ACM\u00a037(2), 238\u2013256 (1990)","journal-title":"Journal of the ACM"},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"SE-8","author":"E.J.H. Chang","year":"1982","unstructured":"Chang, E.J.H.: Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering\u00a0SE-8(4), 391\u2013401 (1982)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TSE.1983.234958","volume":"9","author":"T.Y. Cheung","year":"1983","unstructured":"Cheung, T.Y.: Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Transactions on Software Engineering\u00a09, 504\u2013512 (1983)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(88)90187-1","volume":"26","author":"I. Cidon","year":"1987","unstructured":"Cidon, I.: Yet another distributed depth-first search algorithm. Information Processing Letters\u00a026, 301\u2013305 (1987)","journal-title":"Information Processing Letters"},{"key":"31_CR6","unstructured":"Dobrev, S.: Leader election using any sense of direction. In: 6th International Colloquium on Structural Information and Communication Complexity, Lacanau, pp. 93\u2013104 (July 1999)"},{"issue":"3-4","key":"31_CR7","first-page":"337","volume":"10","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Mathemtica Hunarica\u00a010(3-4), 337\u2013356 (1959)","journal-title":"Acta Mathemtica Hunarica"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In: 4th ACM Symposium on Principles of Distributed Computing, Minaki, pp. 175\u2013185 (August 1985)","DOI":"10.1145\/323596.323612"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum spanning tree. ACM Transactions on Programming Languages and Systems\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/S0097539794261118","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing\u00a027(1), 302\u2013316 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR11","first-page":"317","volume":"4","author":"A. Israeli","year":"1997","unstructured":"Israeli, A., Kranakis, E., Krizanc, D., Santoro, N.: Time-Messages tradeoffs for the weak unison problem. Nordic Journal of Computing\u00a04, 317\u2013329 (1997)","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/77606.77610","volume":"12","author":"E. Korach","year":"1990","unstructured":"Korach, E., Kutten, S., Moran, S.: A modular technique for the design of efficient distributed leader finding algorithms. ACM Transactions on Programming Languages and Systems\u00a012(1), 84\u2013101 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Lynch, N.: A hundred impossibility proofs for distributed computing. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp. 1\u201328 (1989)","DOI":"10.1145\/72981.72982"},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00979869","volume":"13","author":"N. Santoro","year":"1984","unstructured":"Santoro, N.: On the message complexity of distributed problems. Int. Journal of Computer and Information Sciences\u00a013(3), 131\u2013147 (1984)","journal-title":"Int. Journal of Computer and Information Sciences"},{"key":"31_CR15","volume-title":"Design and Analysis of Distributed Algorithms","author":"N. Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. John Wiley, Chichester (2007)"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segall","year":"1983","unstructured":"Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory\u00a0IT-29(1), 23\u201335 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"1994","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T14:23:31Z","timestamp":1553264611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}