| On the structure of linear and cyclic codes over a finite chain ring GH Norton, A Sălăgean Applicable algebra in engineering, communication and computing 10 (6), 489-506, 2000 | 378 | 2000 |
| On the Hamming distance of linear codes over a finite chain ring GH Norton, A Salagean Information Theory, IEEE Transactions on 46 (3), 1060-1067, 2000 | 184 | 2000 |
| Repeated-root cyclic and negacyclic codes over a finite chain ring A Sălăgean Discrete applied mathematics 154 (2), 413-419, 2006 | 48 | 2006 |
| Cyclic codes and minimal strong Gröbner bases over a principal ideal ring GH Norton, A Salagean Finite fields and their applications 9 (2), 237-249, 2003 | 44 | 2003 |
| On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two A Sălăgean Information Theory, IEEE Transactions on 51 (3), 1145-1150, 2005 | 43 | 2005 |
| On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two A Sălăgean Sequences and Their Applications-SETA 2004, 179-184, 2004 | 43 | 2004 |
| On the key equation over a commutative ring GH Norton, A Salagean-Mandache Designs, Codes and Cryptography 20 (2), 125-141, 2000 | 40 | 2000 |
| Strong Grobner bases and cyclic codes over a finite-chain ring. GH Norton, A Sǎlǎgean Electronic Notes in Discrete Mathematics, 240-250, 2001 | 35 | 2001 |
| Parallelisation of genetic algorithms for the 2-page crossing number problem H He, O Sýkora, A Salagean, E Mäkinen Journal of Parallel and Distributed Computing 67 (2), 229-241, 2007 | 21 | 2007 |
| A genetic algorithm for computing the k-error linear complexity of cryptographic sequences A Alecu, AM Salagean Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, 3569-3576, 2007 | 14 | 2007 |
| Comparison of cube attacks over different vector spaces R Winter, A Salagean, RCW Phan | 13 | 2015 |
| An algorithm for computing minimal bidirectional linear recurrence relations A Salagean Information Theory, 2008. ISIT 2008. IEEE International Symposium on, 1746-1750, 2008 | 12 | 2008 |
| Modified Berlekamp-Massey algorithm for approximating the k-error linear complexity of binary sequences A Alecu, A Sălăgean Cryptography and Coding, 220-232, 2007 | 12 | 2007 |
| Factoring polynomials over Z4 and over certain Galois rings A Sălăgean Finite fields and their applications 11 (1), 56-70, 2005 | 12 | 2005 |
| Grobner bases and products of coefficient rings GH Norton, A Salagean BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY 65 (1), 145-152, 2002 | 12 | 2002 |
| Groebner bases and products of coefficient rings GH Norton, A Salagean Australian Mathematical Society. Bulletin 65 (1), 147-154, 2002 | 12 | 2002 |
| On the isometries between< e2> Z</e2>(p< sup> k</sup>) and< e2> Z</e2>< sub> p</sub>< sup> k</sup> A Salagean-Mandache Information Theory, IEEE Transactions on 45 (6), 2146-2148, 1999 | 11* | 1999 |
| One-and two-page crossing numbers for some types of graphs H He, A Sălăgean, E Mäkinen International Journal of Computer Mathematics 87 (8), 1667-1679, 2010 | 10 | 2010 |
| An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform A Alecu, A Salagean Information Theory, 2008. ISIT 2008. IEEE International Symposium on, 2414-2418, 2008 | 10 | 2008 |
| Various island-based parallel genetic algorithms for the 2-page drawing problem H He, O Sykora, AM Salagean | 8 | 2006 |
Raphaël C.-W. PhanProfessor at Monash UniversityBestätigte E-Mail-Adresse bei monash.edu
