Orthogonal polynomials, lattice paths, and skew Young tableaux. PhD Defense, July 14, 2016.

Skew Young tableaux with at most three rows, Chebyshev polynomials, and Motzkin paths. Dartmouth Combinatorics Seminar, April 14, 2016.

Skew Young tableaux with at most three rows, Chebyshev polynomials, and Motzkin paths.MIT Combinatorics Seminar, April 6, 2016.

Skew Young tableaux with at most three rows with Chebyshev polynomials and Motzkin paths.Graduate Student Combinatorics Conference, Clemson University, April 1-3, 2016.

Orthogonal polynomials and skew standard Young tableaux with at most three rows. Brandeis Combinatorics Seminar, January 19, 2016.

Robinson-Schensted for Lattice Paths. Penn State Altoona Colloquium, November 24, 2015.

Orthogonal Polynomials and Motzkin Paths with Peak and Flat Restrictions. 8th International Conference on Lattice Path Combinatorics & Applications, August 17-20, 2015. (announcement)

Counting flawed Motzkin paths by Motzkin numbers. Graduate Student Combinatorics Conference, March 27-29, 2015. (announcement)

Counting flawed Motzkin paths by Motzkin paths. Combinatorics Seminar, Brandeis University, February 24, 2015.

The Robinson-Schensted Correspondence. Graduate Student Seminar, Brandeis University, January 30, 2015.

Enumerative Combinatorics – Multivariate Power Series. Jsoftware Conference, July 24-25 2014.

Counting Non-crossing Trees by Descents. Combinatorics Seminar, Brandeis University, March 31, 2014.

Automaticity of the Braid Group. Graduate Student Seminar, Brandeis University, March 13, 2014.

Counting Binary Trees and Hyperplane Arrangements. Combinatorics Seminar, Brandeis University, October 24, 2013.

Percolation. Graduate Student Seminar, Brandeis University, February 17, 2011.