{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T21:58:16Z","timestamp":1718920696298},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2002,5,19]]},"DOI":"10.1145\/509907.509992","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["Verifying candidate matches in sparse and wildcard matching"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"Courant Institute, NYU, NY, NY"}]},{"given":"Ramesh","family":"Hariharan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2002,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28445"},{"key":"e_1_3_2_1_2_1","first-page":"156","volume-title":"Schulman. Pattern Matching for Spatial Point Sets. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science","author":"Cardoze D.","year":"1998","unstructured":"D. Cardoze , L. Schulman. Pattern Matching for Spatial Point Sets. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science , 1998 , pp. 156 -- 165 . D. Cardoze, L. Schulman. Pattern Matching for Spatial Point Sets. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, 1998, pp. 156--165."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258553"},{"key":"e_1_3_2_1_4_1","first-page":"245","volume-title":"Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms","author":"Cole R.","year":"1999","unstructured":"R. Cole , R. Hariharan , P. Indyk . Tree pattern matching and subset matching in deterministic O(nlog3 m) time . Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms , 1999 , pp. 245 -- 254 . R. Cole, R. Hariharan, P. Indyk. Tree pattern matching and subset matching in deterministic O(nlog3 m) time. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 245--254."},{"key":"e_1_3_2_1_5_1","volume-title":"Tree pattern matching to subset matching in linear time. Submitted to SIAM Journal on Computing","author":"Cole R.","year":"2000","unstructured":"R. Cole , R. Hariharan . Tree pattern matching to subset matching in linear time. Submitted to SIAM Journal on Computing , 2000 . R. Cole, R. Hariharan. Tree pattern matching to subset matching in linear time. Submitted to SIAM Journal on Computing, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89533"},{"key":"e_1_3_2_1_7_1","first-page":"113","article-title":"String matching and other products. Complexity of Computation, SIAM-AMS proceedings, ed","author":"Fisher M.J.","year":"1974","unstructured":"M.J. Fisher , M.S. Paterson . String matching and other products. Complexity of Computation, SIAM-AMS proceedings, ed . R.M. Karp , 1974 , pp. 113 -- 125 . M.J. Fisher, M.S. Paterson. String matching and other products. Complexity of Computation, SIAM-AMS proceedings, ed. R.M. Karp, 1974, pp. 113--125.","journal-title":"R.M. Karp"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12162"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796325"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796430"},{"key":"e_1_3_2_1_12_1","first-page":"457","volume-title":"Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms","author":"Indyk P.","year":"1999","unstructured":"P. Indyk , R. Motwani , S. Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms . Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms , 1999 , pp. 457 -- 465 . P. Indyk, R. Motwani, S. Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 457--465."},{"key":"e_1_3_2_1_13_1","first-page":"655","volume-title":"Cares. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms","author":"Kalai A.","year":"2002","unstructured":"A. Kalai , Efficient Pattern Matching with Don't Cares. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms , 2002 , pp. 655 -- 656 . A. Kalai, Efficient Pattern Matching with Don't Cares. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 655--656."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647813.738283"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60044-2_50"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258545"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"}],"event":{"name":"STOC02: Symposium on the Theory of Computing","location":"Montreal Quebec Canada","acronym":"STOC02","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thiry-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/509907.509992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:01:46Z","timestamp":1673359306000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/509907.509992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5,19]]},"references-count":18,"alternative-id":["10.1145\/509907.509992","10.1145\/509907"],"URL":"http:\/\/dx.doi.org\/10.1145\/509907.509992","relation":{},"subject":[],"published":{"date-parts":[[2002,5,19]]},"assertion":[{"value":"2002-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}