Timothy Gomez

Orcid: 0000-0002-5423-7615

According to our database1, Timothy Gomez authored at least 27 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Verification and computation in restricted Tile Automata.
Nat. Comput., June, 2024

Intrinsic Universality in Seeded Active Tile Self-Assembly.
CoRR, 2024

Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks.
CoRR, 2024

Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More.
Proceedings of the Unconventional Computation and Natural Computation, 2024

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds.
Proceedings of the 30th International Conference on DNA Computing and Molecular Programming, 2024

2023
Building squares with optimal state complexity in restricted active self-assembly.
J. Comput. Syst. Sci., December, 2023

Unique Assembly Verification in Two-Handed Self-Assembly.
Algorithmica, August, 2023

Complexity of verification in self-assembly with prebuilt assemblies.
J. Comput. Syst. Sci., 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.
CoRR, 2023

Complexity of Solo Chess with Unlimited Moves.
CoRR, 2023

Simulation of Multiple Stages in Single Bin Active Tile Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2023

Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles.
Proceedings of the Unconventional Computation and Natural Computation, 2023

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Covert Computation in the Abstract Tile-Assembly Model.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
Reachability in Restricted Chemical Reaction Networks.
CoRR, 2022

Reliability and Security of Extreme Parallelism.
IEEE Consumer Electron. Mag., 2022

2021
Fast reconfiguration of robot swarms with uniform control signals.
Nat. Comput., 2021

The Complexity of Multiple Handed Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2021

Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions.
J. Inf. Process., 2020

Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Building Patterned Shapes in Robot Swarms with Uniform Control Signals.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Full Tilt: Universal Constructors for General Shapes with Uniform External Forces.
CoRR, 2019


  Loading...