{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:52Z","timestamp":1725511792811},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-70918-3_10","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"109-120","source":"Crossref","is-referenced-by-count":1,"title":["Testing Convexity Properties of Tree Colorings"],"prefix":"10.1007","author":[{"given":"Eldar","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orly","family":"Yahalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N. Alon","year":"2001","unstructured":"Alon, N., et al.: Regular languages are testable with a constant number of queries. Siam Journal on Computing\u00a030(6), 1842\u20131862 (2001)","journal-title":"Siam Journal on Computing"},{"key":"10_CR2","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing (Also In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. I, pp. 229\u2013264. World Scientific Publishing (2004)). Bulletin of the European Association for Theoretical Computer Science\u00a075, 97\u2013126, Section 8 (2001)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"4","key":"10_CR3","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.: Propery testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica\u00a032, 302\u2013343 (2002)","journal-title":"Algorithmica"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: Proceedings of the 7 th RANDOM and the 6 th APPROX, pp. 302\u2013317 (2003)","DOI":"10.1007\/978-3-540-45198-3_26"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free connectivity testing. In: Proceedings of the 8 th RANDOM and the 7 th APPROX, pp. 393\u2013404 (2004)","DOI":"10.1007\/978-3-540-27821-4_35"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR8","volume-title":"The Art of Computer Programming, vol. 1: Fundamental Algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 1: Fundamental Algorithms, 2nd edn. Addison-Wesley, Reading (1973)","edition":"2"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Moran, S., Snir, S.: Convex recolorings of phylogenetic trees: definitions, hardness results and algorithms (Also: Journal of Computer and System Sciences (JCSS), in press). In: Workshop on Algorithms and Data Structures (WADS), pp. 218\u2013232 (2005)","DOI":"10.1007\/11534273_20"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fischer, E., et al.: Monotonicity testing over general poset domains. In: Proceedings of the 34th STOC, pp. 474\u2013483 (2002)","DOI":"10.1145\/509973.509977"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-36383-1_8","volume-title":"Experimental Algorithmics","author":"B.M.E. Moret","year":"2002","unstructured":"Moret, B.M.E., Warnow, T.: Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol.\u00a02547, pp. 163\u2013180. Springer, Heidelberg (2002)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1111\/j.1467-968X.2005.00149.x","volume":"3","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., et al.: A comparison of phylogenetic reconstruction methods on an IE dataset. Transactions of the Philological Society\u00a03(2), 171\u2013192 (2005)","journal-title":"Transactions of the Philological Society"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of Randomized Computing, vol. II","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., et al. (eds.) Handbook of Randomized Computing, vol. II, pp. 597\u2013649. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"252","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 Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplifications and parallelization. SIAM Journal on Computing\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR17","first-page":"222","volume-title":"Proceedings of the 18th IEEE FOCS","author":"A.C. Yao","year":"1977","unstructured":"Yao, A.C.: Probabilistic computation, towards a unified measure of complexity. In: Proceedings of the 18th IEEE FOCS, pp. 222\u2013227. IEEE Computer Society Press, Los Alamitos (1977)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T13:19:42Z","timestamp":1707916782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709176","9783540709183"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}