Red X iconGreen tick iconYellow tick icon


Owheo Building, Room 2.52
Tel +64 3 479 8586

My background is in mathematics, particularly in algebra, combinatorics, and logic. These areas all relate to the theoretical side of computer science, specifically the study of (effective) computability, and the representation and manipulation of data.

I am particularly interested in algorithms for counting (either exactly or approximately), sampling from, or manipulating combinatorial objects. I am an enthusiastic advocate of the use of computing resources in problem solving activities of all types. The study of combinatorial games is a particularly fruitful source of such problems, and also provides illustrations of the thesis that some hard computational problems can be rendered much simpler by a suitable change of perspective.

Inaugural Professorial Lecture, 16th of April 2013, can be viewed here (237MB) or listened to here (67MB).


Albert, M., Bouvel, M., Féray, V., & Noy, M. (2024). A logical limit law for 231-avoiding permutations. Discrete Mathematics & Theoretical Computer Science, 26(1). doi: 10.46298/dmtcs.11751 Journal - Research Article

Albert, M., Gudmundsson, B., & Ulfarsson, H. (2022). Collatz meets Fibonacci. Mathematics Magazine, 95(2), 130-136. doi: 10.1080/0025570X.2022.2023307 Journal - Research Article

Albert, M., Jelínek, V., & Opler, M. (2021). Two examples of Wilf-collapse. Discrete Mathematics & Theoretical Computer Science, 22(2), 9. doi: 10.46298/DMTCS.5986 Journal - Research Article

Albert, M., & Tannock, M. (2021). Prolific permutations. Electronic Journal of Combinatorics, 28(2), 2.2. doi: 10.37236/9966 Journal - Research Article

Albert, M., & Vatter, V. (2020). How many pop-stacks does it take to sort a permutation? arXiv. Retrieved from Working Paper; Discussion Paper; Technical Report

Back to top