Catalin-Valeriu Lita. On Complexity of the Detection Problem for Bounded Length Polymorphic Viruses. In James H. Davenport, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie, editors, 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, September 24-27, 2016. pages 371-378, IEEE Computer Society, 2016. [doi]
@inproceedings{Lita16-0,
title = {On Complexity of the Detection Problem for Bounded Length Polymorphic Viruses},
author = {Catalin-Valeriu Lita},
year = {2016},
doi = {10.1109/SYNASC.2016.064},
url = {http://dx.doi.org/10.1109/SYNASC.2016.064},
researchr = {https://researchr.org/publication/Lita16-0},
cites = {0},
citedby = {0},
pages = {371-378},
booktitle = {18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, September 24-27, 2016},
editor = {James H. Davenport and Viorel Negru and Tetsuo Ida and Tudor Jebelean and Dana Petcu and Stephen M. Watt and Daniela Zaharie},
publisher = {IEEE Computer Society},
isbn = {978-1-5090-5707-8},
}