{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:29Z","timestamp":1725619109730},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_6","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"47-61","source":"Crossref","is-referenced-by-count":1,"title":["Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example"],"prefix":"10.1007","author":[{"given":"Joffroy","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"Peva","family":"Blanchard","sequence":"additional","affiliation":[]},{"given":"Janna","family":"Burman","sequence":"additional","affiliation":[]},{"given":"Sylvie","family":"Dela\u00ebt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fisher, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC, pp. 290\u2013299 (2004)","DOI":"10.1145\/1011767.1011810"},{"issue":"3","key":"6_CR2","first-page":"183","volume":"21","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. DC\u00a021(3), 183\u2013199 (2008)","journal-title":"DC"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D. Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing\u00a020(4), 279\u2013304 (2007)","journal-title":"Distributed Computing"},{"key":"6_CR4","unstructured":"Beauquier, J., Blanchard, P., Burman, J., Delaet, S.: Exact time complexity of zebranet with cover times. LRI Internal Report (2011)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Burman, J., Cl\u00e9ment, J., Kutten, S.: On utilizing speed in networks of mobile agents. In: PODC, pp. 305\u2013314 (2010)","DOI":"10.1145\/1835698.1835775"},{"issue":"33","key":"6_CR6","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1016\/j.tcs.2010.09.016","volume":"412","author":"J. Beauquier","year":"2011","unstructured":"Beauquier, J., Burman, J., Kutten, S.: A self-stabilizing transformer for population protocols with covering. Theor. Comput. Sci.\u00a0412(33), 4247\u20134259 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-75142-7_8","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2007","unstructured":"Beauquier, J., Cl\u00e9ment, J., Messika, S., Rosaz, L., Rozoy, B.: Self-stabilizing counting in mobile sensor networks with a base station. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 63\u201376. Springer, Heidelberg (2007)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cai, H., Eun, D.Y.: Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET. In: MOBICOM, pp. 159\u2013170 (2007)","DOI":"10.1145\/1287853.1287873"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/TMC.2007.1060","volume":"6","author":"A. Chaintreau","year":"2007","unstructured":"Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing\u00a06, 606\u2013620 (2007)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"6_CR10","unstructured":"College, D.: The dartmouth wireless trace archive (2007)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11945529_28","volume-title":"Principles of Distributed Systems","author":"M. Fischer","year":"2006","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing leader election in networks of finite-state anonymous agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 395\u2013409. Springer, Heidelberg (2006)"},{"key":"6_CR13","unstructured":"Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04. York University (2007)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Hong, S., Rhee, I., Kim, S.J., Lee, K., Chong, S.: Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model. In: MobilityModels, pp. 25\u201332 (2008)","DOI":"10.1145\/1374688.1374694"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.-S., Rubenstein, D.: Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: ASPLOS, pp. 96\u2013107 (2002)","DOI":"10.1145\/605397.605408"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Karagiannis, T., Boudec, J.L., Vojnovic, M.: Power law and exponential decay of inter contact times between mobile devices. In: MOBICOM, pp. 183\u2013194 (2007)","DOI":"10.1145\/1287853.1287875"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A. Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., Schel\u00e9n, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev.\u00a07, 19\u201320 (2003)","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"6_CR18","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"2001","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T02:53:50Z","timestamp":1560740030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}