{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:03:13Z","timestamp":1746158593793,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453458"},{"type":"electronic","value":"9783642453465"}],"license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45346-5_14","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T12:33:16Z","timestamp":1386851596000},"page":"185-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Effect of Forgetting on the Performance of a Synchronizer"],"prefix":"10.1007","author":[{"given":"Matthias","family":"F\u00fcgger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"K\u00f6\u00dfler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Zeiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM 32, 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"14_CR2","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)"},{"key":"14_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)"},{"key":"14_CR4","volume-title":"Concrete Mathematics","author":"RL Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1989)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Jayaram, M., Varghese, G.: Crash failures can drive protocols to arbitrary states. 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 247\u2013256. ACM, New York (1996)","DOI":"10.1145\/248052.248104"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02243826","volume":"51","author":"P Kirschenhofer","year":"1993","unstructured":"Kirschenhofer, P., Prodinger, H.: A result in order statistics related to probabilistic counting. Computing 51(1), 15\u201327 (1993)","journal-title":"Computing"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/128733.128735","volume":"8","author":"KA Marzullo","year":"1990","unstructured":"Marzullo, K.A.: Tolerating failures of continuous-valued sensors. ACM Trans. on Comput. Syst. 8(4), 284\u2013304 (1990)","journal-title":"ACM Trans. on Comput. Syst."},{"key":"14_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3267-7","volume-title":"Markov Chains and Stochastic Stability","author":"S Meyn","year":"1993","unstructured":"Meyn, S., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, Heidelberg (1993)"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1267070.1267073","volume":"39","author":"EF Nakamura","year":"2007","unstructured":"Nakamura, E.F., Loureiro, A.A.F., Frery, A.C.: Information fusion for wireless sensor networks: methods, models, and classifications. ACM Comput. Surv. 39(3), 9 (2007). doi:10.1145\/1267070.1267073","journal-title":"ACM Comput. Surv."},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Nowak, T., F\u00fcgger, M., K\u00f6\u00dfler, A.: On the Performance of a Retransmission-Based Synchronizer. Theor. Comput. Sci. (2012). doi:10.1016\/j.tcs.2012.04.035","DOI":"10.1016\/j.tcs.2012.04.035"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0020-0190(94)90102-3","volume":"49","author":"S Rajsbaum","year":"1994","unstructured":"Rajsbaum, S.: Upper and lower bounds for stochastic marked graphs. Inform. Process. Lett. 49, 291\u2013295 (1994)","journal-title":"Inform. Process. Lett."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/71.308532","volume":"5","author":"S Rajsbaum","year":"1994","unstructured":"Rajsbaum, S., Sidi, M.: On the performance of synchronized programs in distributed networks with random processing times and transmission delays. IEEE Trans. Parall. Distr. 5, 939\u2013950 (1994)","journal-title":"IEEE Trans. Parall. Distr."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/PL00008927","volume":"14","author":"U Schmid","year":"2001","unstructured":"Schmid, U., Schossmaier, K.: How to reconcile fault-tolerant interval intersection with the Lipschitz condition. Distrib Comp. 14(2), 101\u2013111 (2001)","journal-title":"Distrib Comp."},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02241658","volume":"43","author":"W Szpankowski","year":"1990","unstructured":"Szpankowski, W., Rego, V.: Yet another application of a binomial recurrence order statistics. Computing 43(4), 401\u2013410 (1990)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45346-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:33:32Z","timestamp":1746074012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45346-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"ISBN":["9783642453458","9783642453465"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45346-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013,12,13]]},"assertion":[{"value":"13 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}