Timothy Gomez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Timothy Gomez has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- David Caballero
Department of Computer Science, University of Texas Rio Grande Valley, Edinburg, USA
3 shared publications - Robert Schweller
Department of Computer Science, University of Texas Rio Grande Valley, Edinburg, USA
3 shared publications - Tim Wylie
Department of Computer Science, University of Texas Rio Grande Valley, Edinburg, USA
3 shared publications - Angel A. Cantu
University of Texas Rio Grande Valley, Edinburg, USA
2 shared publications - Austin Luchsinger
Department of Computer Science University of Texas -Rio Grande Valley
1 shared publication - Austin Luchsinger
University of Texas Austin
1 shared publication
Latest Publications
- 17 November 2021
- Published by Springer Nature in Natural Computing
- Vol. 23 (2) , 387-405
Verification and computation in restricted Tile Automata
- 17 November 2021
- Published by Springer Nature in Natural Computing
- Vol. 23 (2) , 387-405
Verification and computation in restricted Tile Automata
- 19 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Consumer Electronics Magazine
- Vol. 11 (4) , 57-64
Reliability and Security of Extreme Parallelism
As we approach the end of Moores law, current processors are reaching their physical limits. The focus has now shifted to multi-core processors and distributed computational systems. Multi-core computers are now the de-facto for most PCs and the use of heterogeneous hardware such as Graphics Processing Units (GPUs) are no longer limited to just the field of high-performance computing. With the increase in cores, the chance that a single unit might fail also increases. In addition, side-Channel attacks have been performed to steal data using parallel processors. Hence, the added features of parallel computing also bring new avenues for unintended errors and malicious attacks. In this article, we provide a systematic overview of current reliability and security concerns in the context of extreme parallelism.
- 19 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Consumer Electronics Magazine
- Vol. 11 (4) , 57-64
Reliability and Security of Extreme Parallelism
As we approach the end of Moores law, current processors are reaching their physical limits. The focus has now shifted to multi-core processors and distributed computational systems. Multi-core computers are now the de-facto for most PCs and the use of heterogeneous hardware such as Graphics Processing Units (GPUs) are no longer limited to just the field of high-performance computing. With the increase in cores, the chance that a single unit might fail also increases. In addition, side-Channel attacks have been performed to steal data using parallel processors. Hence, the added features of parallel computing also bring new avenues for unintended errors and malicious attacks. In this article, we provide a systematic overview of current reliability and security concerns in the context of extreme parallelism.
- 11 October 2021
- Published by Springer Nature
- p. 1-18
The Complexity of Multiple Handed Self-assembly
- 7 August 2021
- Published by Springer Nature in Natural Computing
- Vol. 20 (4) , 659-669
Fast reconfiguration of robot swarms with uniform control signals
- 7 August 2021
- Published by Springer Nature in Natural Computing
- Vol. 20 (4) , 659-669
Fast reconfiguration of robot swarms with uniform control signals
- Open Access
Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions
Motivated by advances is nanoscale applications and simplistic robot agents, we look at problems based on using a global signal to move all agents when given a limited number of directional signals and immovable geometry. We study a model where unit square particles move within a 2D grid based on uniform external forces. Movement is based on a sequence of uniform commands which cause all particles to move 1 step in a specific direction. The 2D grid board additionally contains "blocked" spaces which prevent particles from entry. Within this model, we investigate the complexity of deciding 1) whether a target location on the board can be occupied (by any) particle (\emph{occupancy problem}), 2) whether a specific particle can be relocated to another specific position in the board (\emph{relocation problem}), and 3) whether a board configuration can be transformed into another configuration (\emph{reconfiguration problem}). We prove that while occupancy is solvable in polynomial time, the relocation and reconfiguration problems are both NP-Complete even when restricted to only 2 or 3 movement directions. We further define a hierarchy of board geometries and show that this hardness holds for even very restricted classes of board geometry.
Open AccessHardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions
Motivated by advances is nanoscale applications and simplistic robot agents, we look at problems based on using a global signal to move all agents when given a limited number of directional signals and immovable geometry. We study a model where unit square particles move within a 2D grid based on uniform external forces. Movement is based on a sequence of uniform commands which cause all particles to move 1 step in a specific direction. The 2D grid board additionally contains "blocked" spaces which prevent particles from entry. Within this model, we investigate the complexity of deciding 1) whether a target location on the board can be occupied (by any) particle (\emph{occupancy problem}), 2) whether a specific particle can be relocated to another specific position in the board (\emph{relocation problem}), and 3) whether a board configuration can be transformed into another configuration (\emph{reconfiguration problem}). We prove that while occupancy is solvable in polynomial time, the relocation and reconfiguration problems are both NP-Complete even when restricted to only 2 or 3 movement directions. We further define a hierarchy of board geometries and show that this hardness holds for even very restricted classes of board geometry.