| Computability of countable subshifts in one dimension D Cenzer, A Dashti, F Toska, S Wyman Theory of Computing Systems 51 (3), 352-371, 2012 | 16 | 2012 |
| Algorithmic randomness and capacity of closed sets D Cenzer, P Brodhead, F Toska, S Wyman Logical Methods in Computer Science 7, 2011 | 11 | 2011 |
| Algorithmic randomness and capacity of closed sets D Cenzer, P Brodhead, F Toska, S Wyman Logical Methods in Computer Science 7, 2011 | 11 | 2011 |
| Computability of countable subshifts D Cenzer, A Dashti, F Toska, S Wyman Conference on Computability in Europe, 88-97, 2010 | 10 | 2010 |
| Using data compression for buried hazard detection F Toska, JN Wilson Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XXII …, 2017 | 2 | 2017 |
| Strict process machine complexity F Toska Archive for Mathematical Logic 53, 525-538, 2014 | 1 | 2014 |
| Effective symbolic dynamics and complexity F Toska University of Florida, 2013 | 1 | 2013 |
| A deep neural network model for hazard classification JN Wilson, F Toska, M Levental, PJ Dobbins Artificial Intelligence and Machine Learning in Defense Applications 11169 …, 2019 | | 2019 |
| Algorithmic Randomness and Capacity of Closed Sets D Cenzer, P Brodhead, F Toska, S Wyman Logical Methods in Computer Science 7, 2011 | | 2011 |
