drew-rwx
Andrew Rodriguez | PhD Student
San Marcos, Texas
Hello! My name is Andrew Rodriguez. I am a PhD student at Texas State University (TXST) studying computer science. I am a member of the Efficient Computing Laboratory (ECL), advised by Dr. Martin Burtscher. My research interests include nature-inspired algorithms, data compression, computational complexity and game theory.
Previously, I attended the University of Texas Rio Grande Valley (UTRGV) and received my master’s in computer science. I researched with the Algorithmic Self-Assembly Research Group (ASARG) at UTRGV under Dr. Tim Wylie and Dr. Robert Schweller. Before that, I attended the University of Texas at Austin and received my bachelor’s in computer science.
Outside of research, I love to read and write. My favorite book right now is ‘Negative Space’ by B. R. Yeager. I also enjoy watching movies, and making my own mixes of my favorite songs.
news
Jun 20, 2023 | Complexity of Reconfiguration in Surface Chemical Reaction Networks accepted at DNA ‘23 |
---|---|
Jun 19, 2023 | Covert Computation in the Abstract Tile-Assembly Model presented at SAND ‘23 |
Jun 3, 2023 | Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change accepted at CCCG ‘23 |
Mar 19, 2023 | Covert Computation in the Abstract Tile-Assembly Model accepted at SAND ‘23 |
Mar 17, 2023 | Simulation of Multiple Stages in Single Bin Active Tile Self-Assembly presented by me :) at UCNC ‘23 |
selected publications
-
Complexity of Reconfiguration in Surface Chemical Reaction NetworksTo appear in Proc. of the 29th International Conference on DNA Computing and Molecular Programming (DNA’23), 2023
-
Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State ChangeTo appear in Proc. of the 35th Canadian Conference on Computational Geometry (CCCG’23), 2023
-
Covert Computation in the Abstract Tile-Assembly ModelIn Proc. of the Symposium on Algorithmic Foundations of Dynamic Networks (SAND’23), 2023
-
Simulation of Multiple Stages in Single Bin Active Tile Self-AssemblyIn Proc. of the 20th International Conference on Unconventional Computation and Natural Computation (UCNC’23), 2023
-
Reachability in Population Protocols is PSPACE-Complete (Short Abstract)In The 24th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3’22), 2022
-
Building Squares with Optimal State Complexity in Restricted Active Self-AssemblyIn Proc. of the Symposium on Algorithmic Foundations of Dynamic Networks (SAND’22), 2022