{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:36:46Z","timestamp":1740202606643,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132834"},{"type":"electronic","value":"9783642132841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13284-1_6","type":"book-chapter","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T07:43:53Z","timestamp":1275723833000},"page":"57-71","source":"Crossref","is-referenced-by-count":0,"title":["Event Extent Estimation"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1991","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley, Chichester (1991)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Birk, Y., Keidar, I., Liss, L., Schuster, A., Wolff, R.: Veracity Radius: Capturing the Locality of Distributed Computations. In: Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 102\u2013111 (2006)","DOI":"10.1145\/1146381.1146399"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Davison, A.: Laptops as Earthquake Sensors. In: MIT Technology Review (2008)","DOI":"10.1063\/pt.5.022171"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H.N. Gabow","year":"1992","unstructured":"Gabow, H.N., Westermann, H.H.: Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica\u00a07(1), 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., Taeubig, H.: A Polylogarithmic Time Algorithm for Distributed Self-Stabilizing Skip Graphs. In: Proc. 28th ACM Symposium on Principles of Distributed Computing, PODC (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"6_CR6","unstructured":"Jiang, C., Dong, G., Wang, B.: Detection and Tracking of Region-Based Evolving Targets in Sensor Networks. In: Proc. 14th International Conference on Computer Communications and Networks, ICCCN (2005)"},{"key":"6_CR7","unstructured":"Kim, H.-A., Karp, B.: Autograph: Toward Automated, Distributed Worm Signature Detection. In: Proc. 13th Usenix Security Symposium, Security (2004)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM Journal of Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Mans, B., Schmid, S., Wattenhofer, R.: Distributed Disaster Disclosure. In: Proc. 11th Scandinavian Workshop on Algorithm Theory, SWAT (2008)","DOI":"10.1007\/978-3-540-69903-3_23"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.S.J. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.: Edge-disjoint spanning trees of finite graphs. J.\u00a0of London Mathematical Society\u00a036, 445\u2013450 (1961)","journal-title":"J.\u00a0of London Mathematical Society"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-sensitive Approach, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"}],"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-642-13284-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:46:17Z","timestamp":1740159977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13284-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132834","9783642132841"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13284-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}