| [1] | C. Koukouvinos and D. E. Simos. Combinatorial Designs with Applications to Coding Theory and Cryptography. Walter de Gruyter, Berlin, 2013 (in preparation). [ bib ] |
| [2] | I. S. Kotsireas, C. Koukouvinos, P. M. Pardalos, and D. E. Simos. Competent genetic algorithms for weighing matrices. to appear in J. Comb. Optim. [ bib ] |
| [3] | C. Koukouvinos and D. E. Simos. Encryption schemes from williamson matrices. J. Inf. Assur. Secur., 7:252-258, 2012. [ bib ] |
| [4] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. A meta-software system for orthogonal designs and hadamard matrices. J. Appl. Math. & Informatics, 29:1571-1581, 2011. [ bib ] |
| [5] | C. Koukouvinos, K. Mylona, and D. E. Simos. An algorithmic construction of e(s2)-optimal supersaturated designs. J. Stat. Theory Pract., 5:357-367, 2011. [ bib ] |
| [6] | C. Koukouvinos, V. Pillwein, D. E. Simos, and Z. Zafeirakopoulos. On the average complexity for the verification of compatible sequences. Inform. Process. Lett., 111:825-830, 2011. [ bib ] |
| [7] | C. Koukouvinos and D. E. Simos. Quasi-cyclic codes from cyclic-structured designs with good properties. Discrete Math. Algorithms Appl., 3:223-243, 2011. [ bib ] |
| [8] | C. Koukouvinos and D. E. Simos. On the computation of the non-periodic autocorrelation function of two ternary sequences and its related complexity analysis. J. Appl. Math. & Informatics, 29:547-562, 2011. [ bib ] |
| [9] | C. Koukouvinos and D. E. Simos. Encryption schemes using plotkin arrays. Appl. Math. & Inf. Sci., 5:500-510, 2011. [ bib ] |
| [10] | C. Koukouvinos and D. E. Simos. Further results on ternary complementary sequences, orthogonal designs and weighing matrices. Australas. J. Combin., 50:97-112, 2011. [ bib ] |
| [11] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Inequivalent hadamard matrices from near normal sequences. J. Combin. Math. Combin. Comput., 75:105-115, 2010. [ bib ] |
| [12] | C. Koukouvinos and D. E. Simos. New infinite families of orthogonal designs constructed from complementary sequences. Int. Math. Forum, 5:2655-2665, 2010. [ bib ] |
| [13] | I. S. Kotsireas, C. Koukouvinos, J. Seberry, and D. E. Simos. New classes of orthogonal designs constructed from complementary sequences with given spread. Australas. J. Combin., 46:67-78, 2010. [ bib ] |
| [14] | C. Koukouvinos and D. E. Simos. Improving the lower bounds on inequivalent hadamard matrices through orthogonal designs and meta-programming techniques. Appl. Numer. Math., 60:370-377, 2010. [ bib ] |
| [15] | C. Koukouvinos and D. E. Simos. New classes of orthogonal designs and weighing matrices derived from near normal sequences. Australas. J. Combin., 47:11-20, 2010. [ bib ] |
| [16] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Mds and near-mds self-dual codes over large prime fields. Adv. Math. Commun., 3:349-361, 2009. [ bib ] |
| [17] | C. Koukouvinos, E. Lappas, and D. E. Simos. Encryption schemes using orthogonal arrays. J. Discrete Math. Sci. Cryptogr., 12:615-628, 2009. [ bib ] |
| [18] | C. Koukouvinos, K. Mylona, D. E. Simos, and A. Skountzou. An algorithmic construction of four-level response surface designs. Comm. Statist. Simulation Comput., 38:2152-2160, 2009. [ bib ] |
| [19] | C. Koukouvinos and D. E. Simos. Construction of new self-dual codes over gf(5) using skew-hadamard matrices. Adv. Math. Commun., 3:251-263, 2009. [ bib ] |
| [20] | C. Koukouvinos, K. Mylona, and D. E. Simos. A hybrid saga algorithm for the construction of e(s2)-optimal cyclic supersaturated designs. J. Statist. Plann. Inference, 139:478-485, 2009. [ bib ] |
| [21] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Inequivalent hadamard matrices from base sequences. Util. Math., 78:3-9, 2009. [ bib ] |
| [22] | C. Koukouvinos, K. Mylona, and D. E. Simos. E(s2)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing. J. Statist. Plann. Inference, 138:1639-1646, 2008. [ bib ] |
| [23] | C. Koukouvinos, K. Mylona, and D. E. Simos. Exploring k-circulant supersaturated designs via genetic algorithms. Comput. Statist. Data Anal., 51:2958-2968, 2007. [ bib ] |
| [24] | C. Koukouvinos, K. Mylona, and D. E. Simos. k-circulant supersaturated designs and metaheuristics: A comparative study on construction methods of supersaturated designs. J. Appl. Probab. Stat., 2:37-47, 2007. [ bib ] |
| [25] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Large orthogonal designs via amicable sets of matrices. Int. J. Appl. Math., 12:217-232, 2006. [ bib ] |
| [26] | C. Koukouvinos and D. E. Simos. A bird's eye view of modern symmetric cryptography from combinatorial designs. In AMIMS '11: Applications of Mathematics and Informatics in Military Science, Springer Optimization and its Applications, volume 71, pages 189-219, 2012. [ bib ] |
| [27] | C. Koukouvinos, D. E. Simos, and Z. Varbanov. Hadamard matrices, designs and their secret-sharing schemes. In CAI '11: Proceedings of the 4th International Conference on Algebraic Informatics, Lecture Notes in Computer Science, volume 6742, pages 216-229, 2011. [ bib ] |
| [28] | C. Koukouvinos and D. E. Simos. Combinatorial optimization for weighing matrices with the ordering messy genetic algorithm. In SEA '11: Proceedings of the 10th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, volume 6630, pages 148-156, 2011. [ bib ] |
| [29] | C. Koukouvinos and D. E. Simos. Self-dual codes over small prime fields from combinatorial designs. In CAI '09: Proceedings of the 3rd International Conference on Algebraic Informatics, Lecture Notes in Computer Science, volume 5725, pages 278-287, 2009. [ bib ] |
| [30] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Inequivalent hadamard matrices via orthogonal designs. In MACIS '06: Proceedings of the 1st International Conference on Mathematical Aspects of Computer and Information Sciences, pages 280-286, 2006. [ bib ] |
| [31] | C. Koukouvinos, D. E. Simos, and Z. Zafeirakopoulos. An algebraic framework for extending orthogonal designs. In ISSAC '11: Abstracts of Poster Presentations of the 36th International Symposium on Symbolic and Algebraic Computation, ACM Commun. Comput. Algebra, volume 45, pages 123-124, 2011. [ bib ] |
| [32] | C. Koukouvinos and D. E. Simos. Numerical and algorithmic aspects of orthogonal sequences in combinatorial design theory. In NumAn '10: Book of Proceedings, pages 236-241, 2010. [ bib ] |
| [33] | I. S. Kotsireas, C. Koukouvinos, and D. E. Simos. Utilization of meta-programming in combinatorial design theory. In NumAn '08: Book of Proceedings, pages 117-121, 2008. [ bib ] |
| [34] | C. Koukouvinos, V. Pillwein, D. E. Simos, and Z. Zafeirakopoulos. A note on the average complexity analysis of the computation of periodic and aperiodic ternary complementary pairs. Research Report DK-2010-08, Doctoral Program Computational Mathematics, October 2010. [ bib ] |
This file was generated by bibtex2html 1.94.