Michael J. Coulombe

According to our database, Michael J. Coulombe authored at least 13 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie

CoRR, 2023

Complexity of Solo Chess with Unlimited Moves.

Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch

CoRR, 2023

This Game Is Not Going To Analyze Itself.

Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch

CoRR, 2023

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.

Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Elise Grizzell, Ryan Knobel, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie

Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

2022

Characterizing the Decidability of Finite State Automata Team Games with Communication.

Michael J. Coulombe, Jayson Lynch

Proceedings of the 13th International Symposium on Games, 2022

The Legend of Zelda: The Complexity of Mechanics.

Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt

CoRR, 2022

2020

Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games.

Michael J. Coulombe, Jayson Lynch

Theor. Comput. Sci., 2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen

Theor. Comput. Sci., 2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.

Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang

J. Inf. Process., 2020

Tetris is NP-hard even with <i>O</i>(1) Rows or Columns.

Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal

J. Inf. Process., 2020

Tetris is NP-hard even with $O(1)$ rows or columns.

Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal

CoRR, 2020

2015

Construction, enumeration, and optimization of perfect phylogenies on multi-state data.

Michael J. Coulombe, Kristian Stevens, Dan Gusfield

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015