About

My research is primarily in CS Theory and CS Education. In CS Theory, my research mostly focuses on computational questions involving Combinatorial Game Theory. In CS Education, my interests are broad, but particular areas of interest are alternative grading schemes, classroom interventions, and increasing classroom diversity/inclusivity.

Teaching

• University of California Los Angeles
  • Com Sci 180: Algorithms and Complexity
    • Quarters: Summer 2023 (Instructor)
• University of Southern California
  • CSCI 170: Discrete Methods in Computer Science
    • Semesters: Spring 2018 (TA), Summer 2018 (TA), Spring 2021 (TA)
  • CSCI 201 Principles of Software Development
    • Semesters: Fall 2020 (TA), Summer 2021 (TA)
  • CSCI 270: Introduction to Algorithms
    • Semesters: Fall 2018 (TA), Fall 2019 (TA)

Papers

1. What is an Algorithms Course? Survey Results of Introductory Undergraduate Algorithms Courses in the US
   • Michael Luu, Matthew Ferland, Varun Nagaraj Rao, Arushi Arora, Randy Huynh, Frederick Reiber, Jennifer Wong-Ma, and Michael Shindler. “What is an Algorithms Course? Survey Results of Introductory Undergraduate Algorithms Courses in the US.” In Proceedings of the 54th ACM Technical Symposium on Computer Science Education (SIGCSE 2023) V. 1, pp. 284-290. 2023. DOI: 10.1145/3545945.3569820
2. Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings
   • Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng “Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings” In 11th International Conference on Fun with Algorithms (FUN 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
3. Quantum-Inspired Combinatorial Games: Algorithms and Complexity
   • Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng. “Quantum-Inspired Combinatorial Games: Algorithms and Complexity.” In 11th International Conference on Fun with Algorithms (FUN 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
4. Student misconceptions of dynamic programming: a replication study
   • Michael Shindler, Natalia Pinpin, Mia Markovic, Frederick Reiber, Jee Hoon Kim, Giles Pierre Nunez Carlos, Mine Dogucu et al. “Student misconceptions of dynamic programming: a replication study.” Computer Science Education 32, no. 3 (2022): 288-312.
5. Winning the war by (strategically) losing battles: Settling the complexity of grundy-values in undirected geography
   • Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng. “Winning the war by (strategically) losing battles: Settling the complexity of grundy-values in undirected geography.” In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1217-1228. IEEE, 2022. DOI: 10.1109/FOCS52979.2021.00119
6. Transverse Wave: An impartial color propagation game inspired by social influence and quantum nim
   • Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng. “Transverse Wave: An impartial color propagation game inspired by social influence and quantum nim.” Integers, 21B:A3, 30, 2021
7. The Game of Blocking Pebbles
   • Kyle W. Burke, Matthew Ferland, Michael Fisher, Valentine Gledel, and Craig Tennenhouse. “The Game of Blocking Pebbles.” Integers, 21B:A2, 30, 2021
8. Experience Report: Preemptive Final Exams for Computer Science Theory Classes
   • Michael Shindler, Matthew Ferland, Aaron Cote, and Olivera Grujic. “Experience Report: Preemptive Final Exams for Computer Science Theory Classes.” The Journal of Computing Sciences in Colleges (2020): 9.

Student Mentorship

CS Theory

• Vikram Kher (now at Yale)
• Aki Hasgegawa (current student)

CS Education

• Jee Kim (now at WNC & Associates)
• Michael Luu (now at LeaseCalcs)
• Mia Markovic (now at Georgia Tech)
• Natalia Pinpin (now at Ezoic)
• Freddy Reibar (now at Boston University)
• Arushi Arora (current student)

Talks (outside of publication venues)

• Combinatorial Game Theory Seminar
  • Title: Disjunctive Sums of Quasinimbers are hard
  • September 21st, 2023
  • Based on paper currently being written with Kyle Burke, Svenja Huntemann, and Shanghua Teng
  • The seminar hosts around 5-7 talks a year
• UT Austin Theory Group
  • Title: Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography
  • Date: March 11th, 2022
  • Based on the FOCS publication
• UC Irvine Theory Group
  • Title: Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography
  • Date: November 5th, 2021
  • Based on the FOCS publication
• Canadian Mathematical Society Summer Meeting 2021
  • Title: Quantum Combinatorial Games: Structures and Computational Complexity
  • Date: June 7th, 2021
  • Based on the (at the time) yet to be published manuscript, now a FUN paper
• International Combinatoiral Game Colloquium
  • Title: Slimetrail is PSPACE-Complete
  • January 14nd, 2019
  • Based on the unpublished manuscript
• Sprouts 2018
  • Title: Slimetrail is PSPACE-Complete
  • Datte: April 14th, 2018
  • Based on the unpublished manuscript
• Sprouts 2017
  • Title: Applying Heuristics in Combinatorial Games
  • Date: April 29th, 2017
  • Description: Using heuristic strategies currently applied in Chess and Go to learn about combinatorial games.

Reviewer Experience

• SIGCSE 2024
• CCSCNE 2023
• SIGCSE 2023
• ISAAC 2020

Other Service

• CS PhD Council, Fall 2019 - Spring 2020
• CS Theory Lunch Organizer, Fall 2019 - Spring 2020
• USC Discovery Program, Summer 2019
  • A 2 week summer program for students from the underserved areas around USC
• USC Grade Appearl Committee, Spring 2019

Awards

• USC Best Research Assistant, 2022

Education

• B.S. in Computer Science, Plymouth State University, 2018
• M.S. in Computer Science, University of Southern California, 2021
• Ph.D in Computer Science, University of Southern California, 2024 (expected)
  • Advised by Shanghua Teng