our-people | faculty


Lindsay Jamieson

Teaching Professor

Lindsay Jamieson is a teaching professor for Khoury College at the Roux Institute.  She is also the coordinator for K-12 CS education for Khoury College. Her teaching is primarily in the MSCS and MSDS Align programs. Her research is in K-12 CS education with a focus on increasing diversity and equity within the computer science field.

Prior to joining Northeastern and the Roux Institute, Jamieson was an associate professor of computer science at St. Mary’s College of Maryland in St. Mary’s City, Maryland where she worked for 14 years.

Jamieson earned her PhD in computer science from Clemson University and her Bachelor of Arts in computer science and mathematics from DePauw University. She is the chair of the ACM-W North America Executive Committee and a member of CSTA-Maine.

Jamieson lives in Scarborough with her husband, two daughters and two cats. She enjoys being minutes from the beach and able to go to the ocean no matter the season.

Areas of Expertise

  •  K-12 Computer Science Education
  •  Diversity and Inclusion in Computer Science
  •  Theory and Algorithms


  • Jamieson, Alan C., and Jamieson, Lindsay H. “Computational thinking for computer science majors: an introduction to CS education career pathways.” Journal of Computing Sciences in Colleges 36, no. 3 (2020): 171-171.
  • Jamieson, Lindsay H. and Jamieson, Alan C. “Setting up and running emerging scholars workshops for CS1.  Journal of Computing Sciences in Colleges 30 no 3 (2015): 135
  • Jamieson, Alan C., Jamieson, Lindsay H., and Johnson, Angela C.. 2012. Application of non-programming focused Treisman-style workshops in introductory computer science. In Proceedings of the 43rd ACM technical symposium on Computer Science Education (SIGCSE ’12). Association for Computing Machinery, New York, NY, USA, 271–276. https://doi.org/10.1145/2157136.2157219
  • Jamieson, Lindsay H., Stephen T. Hedetniemi, and Alice A. McRae. “The algorithmic complexity of alliances in graphs.” J. Combin. Math. Combin. Comput 68 (2009): 137-150.
  • Read more on Google Scholar

Related Links