Matthew Ferland

Orcid: 0000-0001-5289-7567

According to our database1, Matthew Ferland authored at least 11 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers.
CoRR, 2024

2023
What is an Algorithms Course?: Survey Results of Introductory Undergraduate Algorithms Courses in the U.S.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

2022
Student misconceptions of dynamic programming: a replication study.
Comput. Sci. Educ., 2022

NP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game.
CoRR, 2022

Quantum-Inspired Combinatorial Games: Algorithms and Complexity.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings.
CoRR, 2021

Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim.
CoRR, 2021

Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Quantum Combinatorial Games: Structures and Computational Complexity.
CoRR, 2020

2017
Computational Properties of Slime Trail.
CoRR, 2017


  Loading...