{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:43Z","timestamp":1740099043671,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77313-1_17","type":"book-chapter","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T02:20:49Z","timestamp":1520389249000},"page":"220-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Permutations Sorted by a Finite and\u00a0an\u00a0Infinite Stack in Series"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2438-3945","authenticated-orcid":false,"given":"Murray","family":"Elder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoong Kuan","family":"Goh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00026-010-0042-9","volume":"14","author":"M Albert","year":"2010","unstructured":"Albert, M., Atkinson, M., Linton, S.: Permutations generated by stacks and deques. Ann. Comb. 14(1), 3\u201316 (2010). https:\/\/doi.org\/10.1007\/s00026-010-0042-9","journal-title":"Ann. Comb."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ejc.2014.08.024","volume":"43","author":"M Albert","year":"2015","unstructured":"Albert, M., Bousquet-M\u00e9lou, M.: Permutations sortable by two stacks in parallel and quarter plane walks. Eur. J. Comb. 43, 131\u2013164 (2015). https:\/\/doi.org\/10.1016\/j.ejc.2014.08.024","journal-title":"Eur. J. Comb."},{"issue":"1\u20132","key":"17_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0304-3975(96)00057-6","volume":"178","author":"MD Atkinson","year":"1997","unstructured":"Atkinson, M.D., Livesey, M.J., Tulley, D.: Permutations generated by token passing in graphs. Theor. Comput. Sci. 178(1\u20132), 103\u2013118 (1997). http:\/\/dx.doi.org\/10.1016\/S0304-3975(96)00057\u20136","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0304-3975(01)00270-5","volume":"289","author":"MD Atkinson","year":"2002","unstructured":"Atkinson, M.D., Murphy, M.M., Ru\u0161kuc, N.: Sorting with two ordered stacks in series. Theor. Comput. Sci. 289(1), 205\u2013223 (2002). http:\/\/dx.doi.org\/10.1016\/S0304-3975(01)00270\u20135","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR5","doi-asserted-by":"crossref","first-page":"A1","DOI":"10.37236\/1693","volume":"9","author":"M B\u00f3na","year":"2003","unstructured":"B\u00f3na, M.: A survey of stack-sorting disciplines. Electron. J. Comb. 9(2), A1 (2003)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"17_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00026-010-0044-7","volume":"14","author":"A Claesson","year":"2010","unstructured":"Claesson, A., Dukes, M., Steingr\u00edmsson, E.: Permutations sortable by $$n-4$$ passes through a stack. Ann. Comb. 14(1), 45\u201351 (2010). https:\/\/doi.org\/10.1007\/s00026-010-0044-7","journal-title":"Ann. Comb."},{"key":"17_CR7","unstructured":"Elder, M.: Permutations generated by a stack of depth 2 and an infinite stack in series. Electron. J. Comb. 13(1), Research Paper #68 (2006). http:\/\/www.combinatorics.org\/Volume_13\/Abstracts\/v13i1r68.html"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Elder, M., Lee, G., Rechnitzer, A.: Permutations generated by a depth 2 stack and an infinite stack in series are algebraic. Electron. J. Comb. 22(2), Paper 2.16, 23 (2015)","DOI":"10.37236\/4571"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.aam.2016.09.003","volume":"83","author":"A Elvey-Price","year":"2017","unstructured":"Elvey-Price, A., Guttmann, A.J.: Permutations sortable by two stacks in series. Adv. Appl. Math. 83, 81\u201396 (2017). https:\/\/doi.org\/10.1016\/j.aam.2016.09.003","journal-title":"Adv. Appl. Math."},{"key":"17_CR10","unstructured":"Goh, Y.K.: Ph.D. thesis, University of Technology Sydney (2019, in preparation)"},{"key":"17_CR11","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Co., Reading (1973)"},{"key":"17_CR12","unstructured":"Murphy, M.M.: Restricted permutations, antichains, atomic classes, stack sorting. Ph.D. thesis, University of St Andrews (2002)"},{"key":"17_CR13","unstructured":"Pierrot, A., Rossin, D.: 2-stack pushall sortable permutations. CoRR abs\/1303.4376 (2013). http:\/\/arxiv.org\/abs\/1303.4376"},{"issue":"3","key":"17_CR14","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/s00224-016-9743-8","volume":"60","author":"A Pierrot","year":"2017","unstructured":"Pierrot, A., Rossin, D.: 2-stack sorting is polynomial. Theory Comput. Syst. 60(3), 552\u2013579 (2017). https:\/\/doi.org\/10.1007\/s00224-016-9743-8","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"17_CR15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s00026-014-0227-8","volume":"18","author":"R Smith","year":"2014","unstructured":"Smith, R.: Two stacks in series: a decreasing stack followed by an increasing stack. Ann. Comb. 18(2), 359\u2013363 (2014). https:\/\/doi.org\/10.1007\/s00026-014-0227-8","journal-title":"Ann. Comb."},{"issue":"12","key":"17_CR16","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.ipl.2009.02.014","volume":"109","author":"R Smith","year":"2009","unstructured":"Smith, R., Vatter, V.: The enumeration of permutations sortable by pop stacks in parallel. Inf. Process. Lett. 109(12), 626\u2013629 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.02.014","journal-title":"Inf. Process. Lett."},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19, 341\u2013346 (1972). https:\/\/doi.org\/10.1145\/321694.321704","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"17_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(93)90321-J","volume":"117","author":"J West","year":"1993","unstructured":"West, J.: Sorting twice through a stack. Theor. Comput. Sci. 117(1), 303\u2013313 (1993)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T01:49:18Z","timestamp":1603936158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}