{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T05:27:55Z","timestamp":1739510875123,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_57","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"685-696","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Structural Consistency"],"prefix":"10.1007","author":[{"given":"Michel","family":"de Rougemont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Vieilleribi\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","unstructured":"Broder, A.: On the Resemblance and Containment of Documents. In: SEQUENCES 1997: Proceedings of the Compression and Complexity of Sequences (1997)"},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11965893_4","volume-title":"Database Theory \u2013 ICDT 2007","author":"M. Rougemont de","year":"2006","unstructured":"de Rougemont, M., Vieilleribi\u00e8re, A.: Approximate Data Exchange. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol.\u00a04353, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"57_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36285-1_14","volume-title":"Database Theory - ICDT 2003","author":"R. Fagin","year":"2002","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data Exchange: Semantics and Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 207\u2013224. Springer, Heidelberg (2002)"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Fischer, E., Magniez, F., de Rougemont, M.: Approximate Satisfiability and Equivalence. In: IEEE Logic in Computer Science, pp. 421\u2013430 (2006)","DOI":"10.1109\/LICS.2006.12"},{"issue":"4","key":"57_CR5","doi-asserted-by":"publisher","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. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"57_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1007\/978-3-540-27836-8_78","volume-title":"Automata, Languages and Programming","author":"F. Magniez","year":"2004","unstructured":"Magniez, F., de Rougemont, M.: Property Testing of Regular Tree Languages. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 932\u2013944. Springer, Heidelberg (2004)"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Martens, W., Neven, F.: Typechecking Top-Down Uniform Unranked Tree Transducers. In: International Conference on Database Theory, pp. 64\u201378 (2002)","DOI":"10.1007\/3-540-36285-1_5"},{"issue":"2","key":"57_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust Characterizations of Polynomials with Applications to Program Testing. SIAM Journal on Computing\u00a025(2), 23\u201332 (1996)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:27:12Z","timestamp":1739467632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}