{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:27Z","timestamp":1781078247946,"version":"3.54.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T00:00:00Z","timestamp":1192752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s00453-007-9075-9","type":"journal-article","created":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T13:51:33Z","timestamp":1192715493000},"page":"160-182","source":"Crossref","is-referenced-by-count":29,"title":["Property-Preserving Data Reconstruction"],"prefix":"10.1007","volume":"51","author":[{"given":"Nir","family":"Ailon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Chazelle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seshadhri","family":"Comandur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ding","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,10,19]]},"reference":[{"key":"9075_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Estimating the distance to a monotone function. In: Proc. 8th RANDOM, pp.\u00a0229\u2013236 (2004)","DOI":"10.1007\/978-3-540-27821-4_21"},{"key":"9075_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Erickson, J.: Geometric range searching and its relatives. Adv. Discret. Comput. Geom. 1\u201356 (1999)","DOI":"10.1090\/conm\/223\/03131"},{"key":"9075_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. In: Proc. 22nd STOC, pp.\u00a073\u201383 (1990)","DOI":"10.1145\/100216.100225"},{"key":"9075_CR4","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. Bull. EATCS 75, 97\u2013126 (2001)","journal-title":"Bull. EATCS"},{"key":"9075_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorial property testing\u2014A survey. In: Randomization Methods in Algorithm Design, pp.\u00a045\u201360 (1998)","DOI":"10.1090\/dimacs\/043\/04"},{"key":"9075_CR6","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"9075_CR7","doi-asserted-by":"crossref","unstructured":"Hoffmann, C.M., Hopcroft, J.E., Karasick, M.S.: Towards implementing robust geometric computations. In: Proc. 4th SOCG, pp.\u00a0106\u2013117 (1988)","DOI":"10.1145\/73393.73405"},{"key":"9075_CR8","doi-asserted-by":"crossref","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: RANDOM-APPROX, pp.\u00a0302\u2013317 (2003)","DOI":"10.1007\/978-3-540-45198-3_26"},{"key":"9075_CR9","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. ECCC TR04-010 (2004)"},{"key":"9075_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"B. Reed","year":"2003","unstructured":"Reed, B.: The height of a random binary search tree. J. ACM 50, 306\u2013332 (2003)","journal-title":"J. ACM"},{"key":"9075_CR11","doi-asserted-by":"crossref","unstructured":"Ron, D.: Property testing. In: Handbook on Randomization, vol.\u00a0II, pp.\u00a0597\u2013649 (2001)","DOI":"10.1007\/978-1-4615-0013-1_15"},{"key":"9075_CR12","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 647\u2013668 (1996)","journal-title":"SIAM J. Comput."},{"key":"9075_CR13","doi-asserted-by":"crossref","unstructured":"Salesin, S., Stolfi, J., Guibas, L.J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th SOCG, pp.\u00a0208\u2013217 (1988)","DOI":"10.1145\/73833.73857"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9075-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9075-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9075-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:00Z","timestamp":1559123100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9075-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,19]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9075"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9075-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,19]]}}}