Cited By
View all- F�r�e HHym SMayero MMoyen JNowak DAndronick JFelty A(2018)Formal proof of polynomial-time complexity with quasi-interpretationsProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167097(146-157)Online publication date: 8-Jan-2018
- Ogunyanda KFamilua ASwart TFerreira HCheng L(2017)Evaluation of mixed permutation codes in PLC channels, using Hamming distance profileTelecommunications Systems10.1007/s11235-016-0224-965:1(169-179)Online publication date: 1-May-2017