{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T01:42:24Z","timestamp":1758591744264,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669700","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"283-291","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumerating polynomial colored permutation classes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2315-5331","authenticated-orcid":false,"given":"Sa\u00fal A.","family":"Blanco","sequence":"first","affiliation":[{"name":"Computer Science, Indiana University Bloomington, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8379-5809","authenticated-orcid":false,"given":"Daniel","family":"Skora","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2013-05804-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113624"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.08.008"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.23638\/DMTCS-21-2-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597066.3597088"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79987-8_10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2318260"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.09.027"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.11.019"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.37236\/1080"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2002.1004278"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.37236\/1682"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(94)00096-S"},{"key":"e_1_3_2_1_16_1","volume-title":"The Art of Computer Programming","author":"Knuth E.","unstructured":"Donald\u00a0E. Knuth. 1997. The Art of Computer Programming, Volume 1 (3rd ed.): fundamental algorithms. Addison Wesley Longman Publishing Co., Inc., USA.","edition":"3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90054-O"},{"key":"e_1_3_2_1_18_1","unstructured":"Toufik Mansour. 2001\/02. Pattern avoidance in coloured permutations. S\u00e9m. Lothar. Combin. 46 (2001\/02) Art. B46g 12pp."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-003-0190-2"},{"key":"e_1_3_2_1_20_1","first-page":"321","article-title":"Enumeration of Wilf classes in Sn\u2240Cr for two patterns of length 3","volume":"21","author":"Phillipson Mitch","year":"2010","unstructured":"Mitch Phillipson, Manda Riehl, and Tristan Williams. 2010. Enumeration of Wilf classes in Sn\u2240Cr for two patterns of length 3. Pure Math. Appl. (PU.M.A.) 21, 2 (2010), 321\u2013338.","journal-title":"Pure Math. Appl. (PU.M.A.)"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1994.1021"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1201\/b18255-18"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669700","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:51:42Z","timestamp":1758588702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":22,"alternative-id":["10.1145\/3666000.3669700","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669700","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}