@misc{pudwell2017,
  title={Two-stack-sorting with pop stacks},
  author={Pudwell, L. and Smith, R.},
  eprinttype={arXiv},
  eprint={1801.05005},
  year={2018}
}

@misc{popstacksgithub,
  title={Enumerating the k-pop-stack-sortable permutations},
  author={Claesson, A. and Gu{\dh}mundsson, B.A.},
  url={https://github.com/SuprDewd/popstacks}
}

@manual{sage,
  Key          = {SageMath},
  Author       = {The Sage Developers},
  Title        = {{S}ageMath, the {S}age {M}athematics {S}oftware {S}ystem ({V}ersion 7.6)},
  Year         = {2017},
}

@article{ulfarsson2012describing,
  title={Describing West-3-stack-sortable permutations with permutation patterns},
  author={{\'U}lfarsson, H.},
  journal={S{\'e}m. Lothar. Combin.},
  volume={67},
  pages={Art. B67d, 20 pp.},
  year={2012}
}

@article{albert2015permutations,
  title={Permutations sortable by two stacks in parallel and quarter plane walks},
  author={Albert, M. and Bousquet-M{\'e}lou, M.},
  journal={European J. Combin.},
  volume={43},
  pages={131--164},
  year={2015},
  publisher={Elsevier},
  URL = {https://doi.org/10.1016/j.ejc.2014.08.024}
}

@article{albert2005insertion,
  title={The insertion encoding of permutations},
  author={Albert, M. and Linton, S. and Ru{\v{s}}kuc, N.},
  journal={Electron. J. Combin.},
  volume={12},
  number={1},
  pages={R47},
  year={2005},
  url={http://www.combinatorics.org/ojs/index.php/eljc/article/view/v12i1r47}
}

@article{atkinson1999pop,
  title={Pop-stacks in parallel},
  author={Atkinson, M.D. and Sack, J.-R.},
  journal={Inform. Process. Lett.},
  volume={70},
  number={2},
  pages={63--67},
  year={1999},
  publisher={Elsevier},
  DOI = {10.1016/S0020-0190(99)00049-6}
}

@article{atkinson2002restricted,
  title={Restricted permutations and the wreath product},
  author={Atkinson, M.D. and Stitt, T.},
  journal={Discrete Math.},
  volume={259},
  number={1-3},
  pages={19--36},
  year={2002},
  publisher={Elsevier},
  DOI = {10.1016/S0012-365X(02)00443-0}
}

@article{atkinson1999permuting,
  title={Permuting mechanisms and closed classes of permutations},
  author={Atkinson, Michael D and Beals, Robert},
  journal={Combinatorics, computation \& logic’99 (Auckland)},
  volume={21},
  pages={117--127},
  year={1999}
}

@article{smith2009enumeration,
  title={The enumeration of permutations sortable by pop stacks in parallel},
  author={Smith, R. and Vatter, V.},
     JOURNAL = {Inform. Process. Lett.},
  FJOURNAL = {Information Processing Letters},
    VOLUME = {109},
      YEAR = {2009},
    NUMBER = {12},
     PAGES = {626--629},
   MRCLASS = {68P10 (68R05)},
  MRNUMBER = {2508088},
       DOI = {10.1016/j.ipl.2009.02.014},
}

@article{atkinson2001permutation,
  title={Permutation Involvement and Groups.},
  author={Atkinson, MD and Beals, Robert},
  journal={Quarterly Journal of Mathematics},
  volume={52},
  number={4},
  year={2001}
}

@article{avis1981pop,
  title={On pop-stacks in series},
  author={Avis, D. and Newborn, M.},
  journal={Utilitas Math.},
  volume={19},
  number={129-140},
  pages={410},
  year={1981}
}

@book{knuth1968art,
  title={The Art of Computer Programming, Volume 1: Fundamental Algorithms},
  author={Knuth, D.E.},
  publisher={Addison-Wesley},
  year={1968}
}

@phdthesis{west1990permutations,
  title={Permutations with forbidden subsequences, and stack-sortable permutations},
  author={West, J.},
  year={1990},
  school={Massachusetts Institute of Technology}
}

@article{zeilberger1992proof,
  title={A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2 (3n)!/((n+1)!(2n+1)!)},
  author={Zeilberger, D.},
  journal={Discrete Math.},
  volume={102},
  number={1},
  pages={85--93},
  year={1992},
  publisher={Elsevier},
  DOI = {10.1016/0012-365X(92)90351-F}
}

@article{tarjan1972sorting,
  author={Tarjan, R.},
TITLE = {Sorting using networks of queues and stacks},
   JOURNAL = {J. Assoc. Comput. Mach.},
  FJOURNAL = {Journal of the Association for Computing Machinery},
    VOLUME = {19},
      YEAR = {1972},
     PAGES = {341--346},
   MRCLASS = {60K25},
  MRNUMBER = {0298803},
MRREVIEWER = {T. L. Saaty},
       DOI = {10.1145/321694.321704},
}

@article{schutzenberger1961definition,
  title={On the definition of a family of automata},
  author={Sch{\"u}tzenberger, M.-P.},
  journal={Information and Control},
  volume={4},
  number={2-3},
  pages={245--270},
  year={1961},
  publisher={Elsevier}
}

@article{hopcroft2001introduction,
  title={Introduction to automata theory, languages, and computation},
  author={Hopcroft, J.E. and Motwani, R. and Ullman, J.D.},
  journal={Acm Sigact News},
  volume={32},
  number={1},
  pages={60--65},
  year={2001},
  publisher={ACM}
}

@article{valmari2012fast,
  title={Fast brief practical {DFA} minimization},
  author={Valmari, Antti},
  journal={Information Processing Letters},
  volume={112},
  number={6},
  pages={213--217},
  year={2012},
  publisher={Elsevier}
}

@article{dean2008mapreduce,
  title={MapReduce: simplified data processing on large clusters},
  author={Dean, Jeffrey and Ghemawat, Sanjay},
  journal={Communications of the ACM},
  volume={51},
  number={1},
  pages={107--113},
  year={2008},
  publisher={ACM}
}

@misc{garpur,
  key={IHPC},
  title={Garpur cluster},
  howpublished={IHPC - Icelandic High Performance Computer - University of Iceland and Reykjavik University},
  url={http://ihpc.is/garpur/},
  year={2017}
}