乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:53:20Z","timestamp":1740117200413,"version":"3.37.3"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100005881","name":"Emberi Eroforr\u00e1sok Miniszt\u00e9riuma","doi-asserted-by":"publisher","award":["K108448"],"id":[{"id":"10.13039\/501100005881","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["K108448"],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.ipl.2017.11.003","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T23:17:08Z","timestamp":1510701428000},"page":"7-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Recognizing Union-Find trees is NP-complete"],"prefix":"10.1016","volume":"131","author":[{"given":"Kitti","family":"Gelle","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2017.11.003_br0010","first-page":"208","article-title":"Inferring Strings from Graphs and Arrays","volume":"vol. 2747","author":"Bannai","year":"2003"},{"issue":"6","key":"10.1016\/j.ipl.2017.11.003_br0020","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0020-0190(93)90037-A","article-title":"The recognition of Union trees","volume":"45","author":"Cai","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ipl.2017.11.003_br0030","series-title":"26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26\u201328, 2009, Freiburg, Germany, Proceedings","first-page":"289","article-title":"Reverse engineering prefix tables","volume":"vol. 3","author":"Cl\u00e9ment","year":"2009"},{"year":"2001","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/j.ipl.2017.11.003_br0040"},{"key":"10.1016\/j.ipl.2017.11.003_br0050","first-page":"251","article-title":"Cover Array String Reconstruction","volume":"vol. 6129","author":"Crochemore","year":"2010"},{"issue":"2","key":"10.1016\/j.ipl.2017.11.003_br0060","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1051\/ita:2008030","article-title":"Efficient validation and construction of border arrays and validation of string matching automata","volume":"43","author":"Duval","year":"2009","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3","key":"10.1016\/j.ipl.2017.11.003_br0070","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1051\/ita:2002012","article-title":"Words over an ordered alphabet and suffix permutations","volume":"36","author":"Duval","year":"2002","journal-title":"Theor. Inform. Appl."},{"issue":"1","key":"10.1016\/j.ipl.2017.11.003_br0080","first-page":"51","article-title":"Border array on bounded alphabet","volume":"10","author":"Duval","year":"2005","journal-title":"J. Autom. Lang. Comb."},{"key":"10.1016\/j.ipl.2017.11.003_br0090","series-title":"Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing","first-page":"345","article-title":"The cell probe complexity of dynamic data structures","author":"Fredman","year":"1989"},{"issue":"5","key":"10.1016\/j.ipl.2017.11.003_br0100","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/364099.364331","article-title":"An improved equivalence algorithm","volume":"7","author":"Galler","year":"1964","journal-title":"Commun. ACM"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.ipl.2017.11.003_br0110"},{"issue":"2","key":"10.1016\/j.ipl.2017.11.003_br0120","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00224-013-9522-8","article-title":"Validating the Knuth\u2013Morris\u2013Pratt failure function, fast and online","volume":"54","author":"Gawrychowski","year":"2014","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ipl.2017.11.003_br0130","series-title":"Descriptional Complexity of Formal Systems \u2013 19th IFIP WG 1.02 International Conference","first-page":"152","article-title":"Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete","author":"Gelle","year":"2017"},{"key":"10.1016\/j.ipl.2017.11.003_br0140","series-title":"Language and Automata Theory and Applications","first-page":"422","article-title":"Counting parameterized border arrays for a binary alphabet","volume":"vol. 5457","author":"Tomohiro","year":"2009"},{"issue":"50","key":"10.1016\/j.ipl.2017.11.003_br0150","doi-asserted-by":"crossref","first-page":"6959","DOI":"10.1016\/j.tcs.2011.09.008","article-title":"Verifying and enumerating parameterized border arrays","volume":"412","author":"Tomohiro","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ipl.2017.11.003_br0160","first-page":"316","article-title":"Inferring strings from suffix trees and links on a binary alphabet","volume":"163","author":"Tomohiro","year":"2014","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.ipl.2017.11.003_br0170","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/62029.62030","article-title":"A multidisciplinary survey","volume":"21","author":"Unification","year":"1989","journal-title":"ACM Comput. Surv."},{"issue":"22\u201324","key":"10.1016\/j.ipl.2017.11.003_br0180","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1016\/j.ipl.2013.09.009","article-title":"On the combinatorics of suffix arrays","volume":"113","author":"Kucherov","year":"2013","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ipl.2017.11.003_br0190","first-page":"223","article-title":"Verifying a border array in linear time","volume":"42","author":"Lu","year":"2000","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"2","key":"10.1016\/j.ipl.2017.11.003_br0200","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","article-title":"Certifying algorithms","volume":"5","author":"McConnell","year":"2011","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.ipl.2017.11.003_br0210","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.jda.2015.01.005","article-title":"A suffix tree or not a suffix tree?","volume":"32","author":"Starikovskaya","year":"2015","journal-title":"J. Discret. Algorithms"},{"issue":"2","key":"10.1016\/j.ipl.2017.11.003_br0220","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2017.11.003_br0230","series-title":"Implementations and Experimental Studies of Dynamic Graph Algorithms","first-page":"229","author":"Zaroliagis","year":"2002"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019017301977?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019017301977?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T19:29:14Z","timestamp":1617478154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019017301977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":23,"alternative-id":["S0020019017301977"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2017.11.003","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Recognizing Union-Find trees is NP-complete","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2017.11.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}