{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:21Z","timestamp":1725567561764},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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-16367-8_2","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T11:25:55Z","timestamp":1286450755000},"page":"6-12","source":"Crossref","is-referenced-by-count":0,"title":["The Program of the Mini-Workshop"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"2_CR1","doi-asserted-by":"publisher","first-page":"4032","DOI":"10.1109\/TIT.2005.856958","volume":"51","author":"N. Alon","year":"2005","unstructured":"Alon, N., Krivelevich, M., Kaufman, T., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory\u00a051(11), 4032\u20134038 (2005); An extended abstract appeared in the proceedings of RANDOM 2003 (under the title Testing Low-Degree Polynomials over GF(2)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Benjamini, I., Schramm, O., Shapira, A.: Every Minor-Closed Property of Sparse Graphs is Testable. In: 40th STOC, pp. 393\u2013402 (2008)","DOI":"10.1145\/1374376.1374433"},{"key":"#cr-split#-2_CR3.1","doi-asserted-by":"crossref","unstructured":"Marko, S., Ron, D.: Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs. ACM Transactions on Algorithms 5(2) (2009);","DOI":"10.1145\/1497290.1497298"},{"key":"#cr-split#-2_CR3.2","unstructured":"Extended abstarct in the proceedings of Random (2006)"},{"issue":"1-3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.tcs.2007.04.040","volume":"381","author":"M. Parnas","year":"2007","unstructured":"Parnas, M., Ron, D.: Approximating the Minimum Vertex Cover in Sublinear Time and a Connection to Distributed Algorithms. TCS\u00a0381(1-3), 183\u2013196 (2007); Preliminary version in ECCC (2005)","journal-title":"TCS"},{"issue":"6","key":"2_CR5","first-page":"1012","volume":"72","author":"M. Parnas","year":"2006","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant Property Testing and Distance Approximation. JCSS\u00a072(6), 1012\u20131042 (2006); Preliminary version in ECCC (2004)","journal-title":"JCSS"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Tamaki, S., Yoshida, Y.: A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. In: ECCC, TR09-074 (2009)","DOI":"10.1007\/978-3-642-15369-3_55"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T05:10:50Z","timestamp":1559711450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}