{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:06Z","timestamp":1725583986986},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_5","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"17-23","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Testing Length Four Permutations"],"prefix":"10.1007","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45678-3_31","volume-title":"Algorithms and Computation","author":"M.H. Albert","year":"2001","unstructured":"Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Holton, D.A.: Algorithms for Pattern Involvement in Permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 355\u2013367. Springer, Heidelberg (2001)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/jagm.1997.0905","volume":"28","author":"O. Berkman","year":"1998","unstructured":"Berkman, O., Matias, Y., Ragde, P.: Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. Journal of Algorithms\u00a028, 197\u2013215 (1998)","journal-title":"Journal of Algorithms"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O. Berkman","year":"1993","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms\u00a014, 344\u2013370 (1993)","journal-title":"Journal of Algorithms"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Information Processing Letters\u00a065, 277\u2013283 (1998)","journal-title":"Information Processing Letters"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On Computing the length of longest increasing subsequences. Discrete Mathematics\u00a011, 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00029-X","volume":"61","author":"L. Ibarra","year":"1997","unstructured":"Ibarra, L.: Finding pattern matchings for permutations. Information Processing Letters\u00a061, 293\u2013295 (1997)","journal-title":"Information Processing Letters"},{"unstructured":"Kitaev, S., Mansour, T.: A survey on certain pattern problems, \n                    \n                      http:\/\/www.ru.is\/kennarar\/sergey\/index_files\/Papers\/survey.ps\n                    \n                    \n                  , \n                    \n                      http:\/\/ajuarna.staff.gunadarma.ac.id\/Downloads\/files\/1662\/survey.pdf","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry, An Introduction. Springer (1985)","key":"5_CR8","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ipl.2008.12.006","volume":"109","author":"S. Saxena","year":"2009","unstructured":"Saxena, S.: Dominance made simple. Information Processing Letters\u00a0109, 419\u2013421 (2009)","journal-title":"Information Processing Letters"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BF01941686","volume":"15","author":"R. Tamassia","year":"1996","unstructured":"Tamassia, R., Vitter, J.S.: Optimal cooperative search in fractional cascaded data structures. Algorithmica\u00a015, 154\u2013171 (1996)","journal-title":"Algorithmica"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.dam.2004.10.004","volume":"146","author":"V. Yugandhar","year":"2005","unstructured":"Yugandhar, V., Saxena, S.: Parallel algorithms for separable permutations. Discrete Applied Mathematics\u00a0146, 343\u2013364 (2005)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:21:50Z","timestamp":1557717710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}