{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:13:43Z","timestamp":1648635223510},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,9]],"date-time":"2017-08-09T00:00:00Z","timestamp":1502236800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0163-8","type":"journal-article","created":{"date-parts":[[2017,8,9]],"date-time":"2017-08-09T14:23:39Z","timestamp":1502288619000},"page":"189-208","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for testing occurrences of length 4 patterns in permutations"],"prefix":"10.1007","volume":"35","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"163_CR1","doi-asserted-by":"crossref","unstructured":"Albert MH, Aldred REL, Atkinson MD, Holton DA (2001) Algorithms for pattern involvement in permutations. In: Proceedings ISAAC 2001, Springer Lecture notes computer science, vol. 2223, pp 355\u2013367","DOI":"10.1007\/3-540-45678-3_31"},{"key":"163_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1006\/jagm.1997.0905","volume":"28","author":"O Berkman","year":"1998","unstructured":"Berkman O, Matias Y, Ragde P (1998) Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. J Algorithms 28:197\u2013215","journal-title":"J Algorithms"},{"key":"163_CR3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O Berkman","year":"1993","unstructured":"Berkman O, Schieber B, Vishkin U (1993) Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J Algorithms 14:344\u2013370","journal-title":"J Algorithms"},{"key":"163_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose P, Buss JF, Lubiw A (1998) Pattern matching for permutations. Inf Process Lett 65:277\u2013283","journal-title":"Inf Process Lett"},{"key":"163_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"ML Fredman","year":"1975","unstructured":"Fredman ML (1975) On Computing the length of longest increasing subsequences. Discret Math 11:29\u201335","journal-title":"Discret Math"},{"issue":"6","key":"163_CR6","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.jpdc.2010.01.007","volume":"70","author":"Y Han","year":"2010","unstructured":"Han Y, Saxena S, Shen X (2010) An efficient parallel algorithm for building the separating tree. J Parallel Distrib Comput 70(6):625\u2013629","journal-title":"J Parallel Distrib Comput"},{"key":"163_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0020-0190(97)00029-X","volume":"61","author":"L Ibarra","year":"1997","unstructured":"Ibarra L (1997) Finding pattern matchings for permutations. Inf Process Lett 61:293\u2013295","journal-title":"Inf Process Lett"},{"key":"163_CR8","unstructured":"Karp R, Ramachandran V (1988) A survey of parallel algorithms for shared-memory machines. Technical Report UCB\/CSD 88\/408, Computer Science Division (EECS), University of California, Berkeley"},{"key":"163_CR9","unstructured":"Kitaev S, Mansour T (2003) A survey on certain pattern problems. Available at \n                        http:\/\/www.ru.is\/kennarar\/sergey\/index_files\/Papers\/survey.ps"},{"key":"163_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17333-2","volume-title":"Patterns in permutations and words","author":"S Kitaev","year":"2011","unstructured":"Kitaev S (2011) Patterns in permutations and words. Springer, Berlin"},{"key":"163_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, Berlin"},{"key":"163_CR12","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ipl.2008.12.006","volume":"109","author":"S Saxena","year":"2009","unstructured":"Saxena S (2009) Dominance made simple. Inf Process Lett 109:419\u2013421","journal-title":"Inf Process Lett"},{"key":"163_CR13","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01941686","volume":"15","author":"R Tamassia","year":"1996","unstructured":"Tamassia R, Vitter JS (1996) Optimal cooperative search in fractional cascaded data structures. Algorithmica 15:154\u2013171","journal-title":"Algorithmica"},{"key":"163_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.dam.2004.10.004","volume":"146","author":"V Yugandhar","year":"2005","unstructured":"Yugandhar V, Saxena S (2005) Parallel algorithms for separable permutations. Discret Appl Math 146:343\u2013364","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0163-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0163-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0163-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T10:34:25Z","timestamp":1515407665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0163-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0163-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,9]]}}}