Permutation Reconstruction. - Rebecca Smith 001 (Electron. J. Comb., 2006)

Almost avoiding permutations. - Robert Brignall; Shalosh B. Ekhad; Rebecca Smith 001; Vincent Vatter (Discret. Math., 2009)

The enumeration of permutations sortable by pop stacks in parallel. - Rebecca Smith 001; Vincent Vatter (Inf. Process. Lett., 2009)

Growth Rates for Subclasses of Av(321). - Michael H. Albert; M. D. Atkinson; Robert Brignall; Nikola Ruskuc; Rebecca Smith 001; J. West (Electron. J. Comb., 2010)

Substitution-closed pattern classes. - M. D. Atkinson; Nikola Ruskuc; Rebecca Smith 001 (J. Comb. Theory A, 2011)

A stack and pop stack in series. - Rebecca Smith 001; Vincent Vatter (Australas. J Comb., 2014)

Two-stack-sorting with pop stacks. - Lara Pudwell; Rebecca Smith 001 (Australas. J Comb., 2019)

Pattern avoidance in permutations and their squares. - Miklós Bóna; Rebecca Smith 001 (Discret. Math., 2019)

Passing through a stack k times. - Toufik Mansour; Howard Skogman; Rebecca Smith 001 (Discret. Math. Algorithms Appl., 2019)

Passing through a stack k times with reversals. - Toufik Mansour; Howard Skogman; Rebecca Smith 001 (Eur. J. Comb., 2019)

Sorting via shuffles with a cut after the longest increasing prefix. - Lara Pudwell; Rebecca Smith 001 (Theor. Comput. Sci., 2024)

Sorting inversion sequences. - Toufik Mansour; Howard Skogman; Rebecca Smith 001 (Discret. Math. Theor. Comput. Sci., 2025)