{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:15Z","timestamp":1725558435914},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_34","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"359-370","source":"Crossref","is-referenced-by-count":4,"title":["Online Function Tracking with Generalized Penalties"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Albers, S., Bals, H.: Dynamic TCP acknowledgement: Penalizing long delays. In: Proc.\u00a0of the 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 47\u201355 (2003)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency constrained aggregation in sensor networks. In: Proc.\u00a0of the 14th European Symp. on Algorithms (ESA), pp. 88\u201399 (2006)","DOI":"10.1007\/11841036_11"},{"key":"34_CR3","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"34_CR4","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: Proc.\u00a0of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1076\u20131085 (2008)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Davis, S., Edmonds, J., Impagliazzo, R.: Online algorithms to minimize resource reallocations and network communication. In: Proc.\u00a0of the 9th Int. Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 104\u2013115 (2006)","DOI":"10.1007\/11830924_12"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"D.R. Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. Journal of the ACM\u00a048(2), 243\u2013273 (2001)","journal-title":"Journal of the ACM"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Frederiksen, J.S., Larsen, K.S.: Packet bundling. In: Proc.\u00a0of the 8th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 328\u2013337 (2002)","DOI":"10.1007\/3-540-45471-3_34"},{"issue":"3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"A.R. Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e - 1). Algorithmica\u00a036(3), 209\u2013224 (2003)","journal-title":"Algorithmica"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Khanna, S., Naor, J., Raz, D.: Control message aggregation in group communication protocols. In: Proc.\u00a0of the 29th Int. Colloq. on Automata, Languages and Programming (ICALP), pp. 135\u2013146 (2002)","DOI":"10.1007\/3-540-45465-9_13"},{"issue":"5","key":"34_CR10","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. Journal of the ACM\u00a042(5), 971\u2013983 (1995)","journal-title":"Journal of the ACM"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Tight bounds for delay-sensitive aggregation. Discrete Mathematics and Theoretical Computer Science (DMTCS)\u00a012(1) (2010)","DOI":"10.46298\/dmtcs.489"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Yi, K., Zhang, Q.: Multi-dimensional online tracking. In: Proc.\u00a0of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1098\u20131107 (2009)","DOI":"10.1137\/1.9781611973068.119"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T06:03:14Z","timestamp":1635487394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}