{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:19Z","timestamp":1725488539156},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_9","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:26:17Z","timestamp":1186727177000},"page":"12-23","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Update Strategies for Geometric Computing with Uncertainty"],"prefix":"10.1007","author":[{"given":"Richard","family":"Bruce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"9_CR1","unstructured":"A. Borodin and R. El-Yaniv, \u201cOnline Computation and Competitive Analysis\u201d, Cambridge University Press, 1998."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"T. Feder, R. Motwani, R. Panigrahy, C. Olston, and J. Widom, \u201cComputing the Median with Uncertainty\u201d, Proc 32nd ACM STOC, 602\u2013607, 2000.","DOI":"10.1145\/335305.335386"},{"key":"9_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-36494-3_32","volume-title":"Proc 20th STAC","author":"T. Feder","year":"2003","unstructured":"T. Feder, R. Motwani, L. O\u2019Callaghan, C. Olston and R. Panigrahy, \u201cComputing Shortest Paths with Uncertainty\u201d, Proc 20th STAC, LNCS 2607, 355\u2013366."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"J. Basch, L. Guibas and J. Hershberger, \u201cData Structures for Mobile Data\u201d, Proc 8th ACM-SIAM SODA.","DOI":"10.1006\/jagm.1998.0988"},{"key":"9_CR5","unstructured":"S. Kahan, \u201cA Model for Data in Motion\u201d, STOC 91, 267\u2013277."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"S. Khanna and W.-C. Tan, \u201cOn Computing Functions with Uncertainty\u201d, Proc 20th ACM PODS, 171\u2013182.","DOI":"10.1145\/375551.375577"},{"key":"9_CR7","unstructured":"C. Olston and J. Widom, \u201cOffering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data\u201d, Proc 26th VLDB, Morgan Kempmann, 144\u2013155."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T02:24:42Z","timestamp":1550715882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}