{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:19:41Z","timestamp":1725797981873},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096193"},{"type":"electronic","value":"9783319096209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_16","type":"book-chapter","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T02:07:37Z","timestamp":1405476457000},"page":"194-209","source":"Crossref","is-referenced-by-count":3,"title":["Continuous Aggregation in Dynamic Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Abshoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/978-3-642-45346-5_3","volume-title":"ALGOSENSORS 2013","author":"S. Abshoff","year":"2014","unstructured":"Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., Meyer auf der Heide, F.: Token dissemination in geometric dynamic networks. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol.\u00a08243, pp. 22\u201334. Springer, Heidelberg (2014)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-03850-6_2","volume-title":"Principles of Distributed Systems","author":"S. Abshoff","year":"2013","unstructured":"Abshoff, S., Benter, M., Malatyali, M., Meyer auf der Heide, F.: On two-party communication through dynamic networks. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol.\u00a08304, pp. 11\u201322. Springer, Heidelberg (2013)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Aho, A.V. (ed.) STOC, pp. 230\u2013240. ACM (1987)","DOI":"10.1145\/28395.28421"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00261-7","volume":"181","author":"S. Chaudhuri","year":"1997","unstructured":"Chaudhuri, S., Dubhashi, D.P.: Probabilistic recurrence relations revisited. Theor. Comput. Sci.\u00a0181(1), 45\u201356 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Gilbert, S., Newport, C.C.: Aggregation in dynamic networks. In: Kowalski, D., Panconesi, A. (eds.) PODC, pp. 195\u2013204. ACM (2012)","DOI":"10.1145\/2332432.2332468"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Khanna, S. (ed.) SODA, pp. 717\u2013736. SIAM (2013)","DOI":"10.1137\/1.9781611973105.52"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: Gavoille, C., Fraigniaud, P. (eds.) PODC, pp. 381\u2013390. ACM (2011)","DOI":"10.1145\/1993806.1993885"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-33651-5_12","volume-title":"Distributed Computing","author":"B. Haeupler","year":"2012","unstructured":"Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 166\u2013180. Springer, Heidelberg (2012)"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1145\/195613.195632","volume":"41","author":"R.M. Karp","year":"1994","unstructured":"Karp, R.M.: Probabilistic recurrence relations. J. ACM\u00a041(6), 1136\u20131150 (1994)","journal-title":"J. ACM"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Locher, T., Schmid, S.: Distributed computation of the mode. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 15\u201324. ACM (2008)","DOI":"10.1145\/1400751.1400756"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Locher, T., Wattenhofer, R.: Tight bounds for distributed selection. In: Gibbons, P.B., Scheideler, C. (eds.) SPAA, pp. 145\u2013153. ACM (2007)","DOI":"10.1145\/1248377.1248401"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: Schulman, L.J. (ed.) STOC, pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput.\u00a015(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Ruppert, E., Malkhi, D. (eds.) PODC, pp. 113\u2013122. ACM (2006)","DOI":"10.1145\/1146381.1146401"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) STOC, pp. 581\u2013592. ACM (1992)","DOI":"10.1145\/129712.129769"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 35\u201344. ACM (2008)","DOI":"10.1145\/1400751.1400758"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09620-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:15:16Z","timestamp":1558952116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}