Invited Minisymposium Talks
			Title to be determined, Minisymposium on Large Scale Matrix Computation, AMS Spring Southeastern Sectional Meeting in Lexington, KY, USA, March 27-28, 2010 (Meeting #1057) (2010) http://www.ams.org/amsmtgs/2162_program.html
			Arbitrary Order Hessenberg Quasiseparable Matrices and Polynomials, Three-Part Minisymposium on Quasiseparable Matrices and Polynomials (minisymposium speaker and co-organizer), SIAM Applied Linear Algebra 2009, Monterey, CA, USA (2009) http://www.siam.org/meetings/la09/
			Arbitrary Order Hessenberg Quasiseparable Matrices and Polynomials, Northern Illinois University Linear Algebra Meeting 2009, DeKalb, IL, USA (2009) http://www.math.niu.edu/LA09/
			Classifications of quasiseparable matrices in terms of recurrence relations, Structured Linear Algebra Problems: Analysis, Algorithms, and Applications 2008 - Cortona, Italy (2008) http://www.dm.unipi.it/~cortona08
			Fast algorithms for polynomial-Vandermonde matrices related to quasiseparable matrices, Minisymposium on Interpolation Problems, Eighteenth International symposium on Mathematical Theory of Networks and Systems (MTNS2008) (2008) http://www.cpe.vt.edu/mtns08/
			Fast algorithms for polynomial-Vandermonde matrices related to quasiseparable matrices, Minisymposium on Structured Matrices, IWOTA 2008 - Williamsburg, VA, USA (2008) http://www.math.wm.edu/~vladi/IWOTA/IWOTA2008.htm
			Eigenproblems for quasiseparable matrices, Minisymposium on Eigenproblems: Theory and Computation, ILAS 2008 - Cancun, Mexico (2008) http://star.izt.uam.mx/ILAS08/
			Quasiseparable Matrices and Polynomials, Colloqium Talk, Georgia State University, Atlanta, GA (2008) http://www2.gsu.edu/~wwwmat/research/Colloquiums2007.html
			Fast algorithms for polynomial Vandermonde matrices related to quasiseparable matrices, Minisymposium on Structured matrix algorithms: complexity and stability, ICIAM 2007 - Zurich, Switzerland - 6th International Congress on Industrial and Applied Mathematics (2007)
			Fast algorithms for polynomial Vandermonde matrices related to quasiseparable matrices, Minisymposium on Structured Matrices and Fast Algorithms, SIAM 2006 - Boston, MA (2006)
			A Parker-Forney-Traub like algorithm for quasiseparable-Hessenberg-Vandermonde matrices, Minisymposium on Structured Matrices, IWOTA 2005 - Storrs, CT, USA (2005)
Refereed Talks
			The Equivalence of Pseudo-noise and Hadamard-Sylvester matrices, SPIE 2005 - San Diego, CA (2005)
Contributed Talks
			Quasiseparable matrices and polynomials, Gene Golub Memorial Conference, Dartmouth, MA, USA (2008) http://www.umassd.edu/cas/mathematics/people/leon/conference/
			Quasiseparable matrices and polynomials, Hans Schneider 80th Birthday Meeting, UConn, Storrs, CT (2007)
			The Equivalence of Pseudo-noise and Hadamard-Sylvester matrices, ILAS 2005 - Regina, Canada (2005)
			The generalized Bjorck-Pereyra algorithm for Szego-Vandermonde matrices based on properties of unitary Hessenberg matrices, ILAS 2005 - Regina, Canada (2005)
			Introduction to Linear Codes, Series in Linear Codes, SIGMA Seminar, University of Connecticut (2004)
			The Equivalence of Pseudo-noise and Hadamard-Sylvester matrices, ILAS 2004 - Coimbra, Portugal (2004)