default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Ferland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Kyle Burke, Matthew Ferland
, Shang-Hua Teng:
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. Theor. Comput. Sci. 1005: 114636 (2024)- 2022
- [j1]Michael Shindler, Natalia Pinpin, Mia Markovic, Frederick Reiber, Jee Hoon Kim, Giles Pierre Nunez Carlos, Mine Dogucu, Mark Hong, Michael Luu, Brian Anderson, Aaron Cote, Matthew Ferland, Palak Jain, Tyler Labonte, Leena Mathur, Ryan Moreno, Ryan Sakuma:
Student misconceptions of dynamic programming: a replication study. Comput. Sci. Educ. 32(3): 288-312 (2022)
Conference and Workshop Papers
- 2024
- [c6]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. FUN 2024: 8:1-8:14 - [c5]Ryan E. Dougherty, Tim Randolph, Tzu-Yi Chen, Jeff Erickson, Matthew Ferland, Dennis Komm, Jonathan Liu, Timothy Ng, Seth Poulsen, Smaranda Sandu, Michael Shindler, Edward Talmage, Thomas Zeume:
A Survey of Undergraduate Theory of Computing Curricula. SIGCSE Virtual (2) 2024 - 2023
- [c4]Michael Luu, Matthew Ferland, Varun Nagaraj Rao, Arushi Arora, Randy Huynh, Frederick Reiber, Jennifer Wong-Ma, Michael Shindler:
What is an Algorithms Course?: Survey Results of Introductory Undergraduate Algorithms Courses in the U.S. SIGCSE (1) 2023: 284-290 - 2022
- [c3]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. FUN 2022: 10:1-10:17 - [c2]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Quantum-Inspired Combinatorial Games: Algorithms and Complexity. FUN 2022: 11:1-11:20 - 2021
- [c1]Kyle W. Burke, Matthew T. Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. FOCS 2021: 1217-1228
Informal and Other Publications
- 2024
- [i7]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. CoRR abs/2403.04955 (2024) - 2022
- [i6]Matthew Ferland, Vikram Kher:
NP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game. CoRR abs/2202.10529 (2022) - 2021
- [i5]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim. CoRR abs/2101.07237 (2021) - [i4]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. CoRR abs/2106.02114 (2021) - [i3]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings. CoRR abs/2109.05622 (2021) - 2020
- [i2]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Quantum Combinatorial Games: Structures and Computational Complexity. CoRR abs/2011.03704 (2020) - 2017
- [i1]Matthew Ferland, Kyle Burke:
Computational Properties of Slime Trail. CoRR abs/1712.04496 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
