Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Timothy Gomez
Observed name:
Gomez, Timothy
Institution:
European Space Agency
Observed institutions:
The University of Texas System,
European Space Agency,
The University of Texas Rio Grande Valley,
MIT Computer Science and Artificial Intelligence Laboratory,
Massachusetts Institute of Technology,
The University of Texas at Austin
show all 6
ORCID:
0000-0002-5423-7615
Observed ORCID:
0000-0002-5423-7615
OpenAlex ID:
A5019715129
Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces
2019
·
Jose Balanza-Martinez
, Timothy Gomez
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
14
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly
2022
·
Alaniz, Robert M.
, Caballero, David
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Reachability in Restricted Chemical Reaction Networks
2023
·
Robert M. Alaniz
, Bin Fu
, et al.
·
SSRN Electronic Journal
·
6
Fast reconfiguration of robot swarms with uniform control signals
2021
·
David Caballero
, Angel A. Cantu
, et al.
·
Natural Computing
·
6
Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions
2020
·
David Caballero
, Angel A. Cantu
, et al.
·
Journal of Information Processing
·
6
PDF
Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete.
2020
·
David Caballero
, Angel A. Cantu
, et al.
·
ScholarWorks @ UTRGV (The University of Texas Rio Grande Valley)
·
6
PDF
Verification and computation in restricted Tile Automata
2021
·
David Caballero
, Timothy Gomez
, et al.
·
Natural Computing
·
5
PDF
Building Patterned Shapes in Robot Swarms with Uniform Control Signals
2020
·
David Caballero
, Angel A. Cantu
, et al.
·
ScholarWorks @ UTRGV (The University of Texas Rio Grande Valley)
·
5
Complexity of Solo Chess with Unlimited Moves
2025
·
Josh Brunner
, Lily Chung
, et al.
·
Lecture notes in computer science
·
3
PDF
Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks
2025
·
Rachel Anderson
, Alberto Avila
, et al.
·
Lecture notes in computer science
·
3
PDF
Building squares with optimal state complexity in restricted active self-assembly
2023
·
Robert M. Alaniz
, David Caballero
, et al.
·
Journal of Computer and System Sciences
·
3
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete
2021
·
Caballero, David
, Gomez, Timothy
, et al.
·
ScholarWorks @ UTRGV (The University of Texas Rio Grande Valley)
·
3
PDF
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines
2023
·
Ani, Hayashi
, Coulombe, Michael
, et al.
·
arXiv (Cornell University)
·
2
PDF
Unique Assembly Verification in Two-Handed Self-Assembly
2023
·
David Caballero
, Timothy Gomez
, et al.
·
Algorithmica
·
2
PDF
Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles
2023
·
David Caballero
, Angel A. Cantu
, et al.
·
Lecture notes in computer science
·
2
Simulation of Multiple Stages in Single Bin Active Tile Self-assembly
2023
·
Sonya C. Cirlos
, Timothy Gomez
, et al.
·
Lecture notes in computer science
·
2
PDF
Complexity of verification in self-assembly with prebuilt assemblies
2023
·
David Caballero
, Timothy Gomez
, et al.
·
Journal of Computer and System Sciences
·
1
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly
2022
·
Alaniz, Robert M.
, Caballero, David
, et al.
·
arXiv (Cornell University)
·
1
PDF
The Complexity of Multiple Handed Self-assembly
2021
·
David Caballero
, Timothy Gomez
, et al.
·
Lecture notes in computer science
·
1
A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses
2026
·
Max Bannach
, Erik D. Demaine
, et al.
·
Society for Industrial and Applied Mathematics eBooks
Reachability in restricted chemical reaction networks
2025
·
Robert M. Alaniz
, Bin Fu
, et al.
·
Theoretical Computer Science
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
2025
·
Max Bannach
, Erik D. Demaine
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
PDF
ETH Lower Bounds for n-Queens: Time Waits for Nobody
2025
·
MIT Hardness Group
, Josh Brunner
, et al.
·
Lecture notes in computer science
Uniform robot relocation is hard in only two directions even without obstacles
2024
·
David Caballero
, Angel A. Cantu
, et al.
·
Natural Computing
PDF
Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More
2024
·
Hayashi Ani
, Josh Brunner
, et al.
·
Lecture notes in computer science
Show more works
View as search
Works count:
37
Citation count:
78
H-index:
6
I10-index:
1
Year
Topic
Type