Natasa Jonoska
Affiliations: | University of South Florida, Tampa, FL, United States |
Area:
MathematicsGoogle:
"Natasa Jonoska"Children
Sign in to add trainee| David E. Kephart | grad student | 2005 | University of South Florida |
| Joni B. Pirnot | grad student | 2006 | University of South Florida |
| Daniela Genova | grad student | 2007 | University of South Florida |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Genova D, Hoogeboom HJ, Jonoska N. (2017) A Graph Isomorphism Condition and Equivalence of Reaction Systems. Theoretical Computer Science. 701: 109-119 |
| Jonoska N, Krajcevski M, McColm G. (2015) Counter machines and crystallographic structures. Natural Computing. 15: 97-113 |
| Bonizzoni P, Jonoska N. (2015) Existence of constants in regular splicing languages. Information and Computation. 242: 340-353 |
| Burns J, Dolzhenko E, Jonoska N, et al. (2013) Four-regular graphs with rigid vertices associated to DNA recombination Discrete Applied Mathematics. 161: 1378-1394 |
| Jonoska N, Seeman NC. (2012) Computing by molecular self-assembly. Interface Focus. 2: 504-11 |
| Dolzhenko E, Jonoska N. (2012) Two-dimensional languages and cellular automata International Journal of Foundations of Computer Science. 23: 185-206 |
| Genova D, Jonoska N. (2012) Forbidding and enforcing on graphs Theoretical Computer Science. 429: 108-117 |
| Dolzhenko E, Jonoska N, Seeman NC. (2010) TRANSDUCER GENERATED ARRAYS OF ROBOTIC NANO-ARMS. Natural Computing. 9: 437-455 |
| Jonoska N, Pirnot JB. (2009) Finite state automata representing two-dimensional subshifts Theoretical Computer Science. 410: 3504-3512 |
| Angeleska A, Jonoska N, Saito M. (2009) DNA recombination through assembly graphs Discrete Applied Mathematics. 157: 3020-3037 |