https://orcid.org/0000-0001-5797-8673
References
- Asinowski, A., Banderier, C., Billey, S., Hackl, B., Linusson, S. (2019). Pop-stack sorting and its image: Permutations with overlapping runs. Acta Math. Univ. Comenianae. 88(3): 395–402.
- Atkinson, M. D., Sack, J.-R. (1999). Pop-stacks in parallel. Inform. Process. Lett. 70(2): 63–67.
- Avis, D., Newborn, M. (1981). On pop-stacks in series. Utilitas Math. 19: 129–140.
- Claesson, A., Guðmundsson, B. Á. (2019). Enumerating permutations sortable by k passes through a pop-stack. Adv. Appl. Math. 108: 79–96. doi:10.1016/j.aam.2019.04.002
- Claesson, A., Guðmundsson, B. Á., Pantone, J. (2019). Enumerating the pop-stacked permutations. Available at: https://github.com/SuprDewd/pop-stacked-perms.
- Guttmann, A. J. (1989). Asymptotic analysis of power-series expansions. Phase Transit. Crit. Phenom. 13: 1–234.
- Guttmann, A. J., Jensen, I. (2009).Series analysis. In A. J. Guttmann (editor), Polygons, Polyominoes and Polycubes, Vol. 775, Lecture Notes in Physics, Dordrecht: Springer, pp. 181–202.
- Hebisch, W., Rubey, W. M. (2011), Extended rate, more GFUN. J. Symbolic Comput. 46(8): 889–903,. doi:10.1016/j.jsc.2011.01.004
- Garpur cluster. (2019). IHPC – Icelandic High Performance Computer. Reykjavik, Iceland: University of Iceland and Reykjavik University.
- Kauers, M. (2009). Guessing handbook. Technical Report 09-07, RISC-Linz.
- Khan, M. A. H. (2002). High-order differential approximants. J. Comput. Appl. Math. 149(2): 457–468.
- Pudwell, L., Smith, R. (2019), Two-stack-sorting with pop stacks. Australas. J. Combin. 74: 179–195.
- Salvy, B., Zimmermann, P. (1994), GFUN: A Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20(2): 163–177. doi:10.1145/178365.178368
- Neil, J., Sloane, A. (2019), The online Encyclopedia of integer sequences. Available at: https://oeis.org.
- Smith, R., Vatter, V. (2014), A stack and a pop stack in series. Australas. J. Combin. 58: 157–171.