| Modular trellises A Černý¹, J Gruska The book of L 4, 45, 1986 | 25 | 1986 |
| Proxy and threshold one-time signatures M Al-Ibrahim, A Cerny Applied Cryptography and Network Security: First International Conference …, 2003 | 21 | 2003 |
| Kirkman’s School Projects WW A. Cerny, P. Horak Discrete Mathematics, 189-196, 1997 | 20* | 1997 |
| Modular real-time trellis automata A Černý, J Gruska Fundamenta Informaticae 9 (3), 253-282, 1986 | 14 | 1986 |
| Node-independent spanning trees in Gaussian networks Z Hussain, B AlBdaiwi, A Cerny Journal of Parallel and Distributed Computing 109, 324-332, 2017 | 13 | 2017 |
| On Prouhet’s solution to the equal powers problem A Černý Theoretical Computer Science 491, 33-46, 2013 | 12 | 2013 |
| Generalizations of Parikh mappings A Černý RAIRO-Theoretical Informatics and Applications 44 (2), 209-228, 2010 | 11 | 2010 |
| Edge-disjoint node-independent spanning trees in dense Gaussian networks B AlBdaiwi, Z Hussain, A Cerny, R Aldred The Journal of Supercomputing 72, 4718-4736, 2016 | 10 | 2016 |
| On fairness of D0L systems A Černý Discrete applied mathematics 155 (13), 1769-1773, 2007 | 9 | 2007 |
| Authentication of anycast communication M Al-Ibrahim, A Cerny Computer Network Security: Second International Workshop on Mathematical …, 2003 | 9 | 2003 |
| Solutions to the multi-dimensional Prouhet–Tarry–Escott problem resulting from composition of balanced morphisms A Černý Information and Computation 253, 424-435, 2017 | 5 | 2017 |
| Lyndon factorization of generalized words of Thue A Černý Discrete Mathematics & Theoretical Computer Science 5, 2002 | 5 | 2002 |
| Several extensions of the Parikh matrix L-morphism HMK Alazemi, A Černý Journal of Computer and System Sciences 79 (5), 658-668, 2013 | 4 | 2013 |
| Efficient network protection design models using pre-cross-connected trails MS Kiaei, S Sebbah, A Cerny, H Alazemi, C Assi IEEE transactions on communications 59 (11), 3102-3110, 2011 | 4 | 2011 |
| Efficient domination in directed tori and the Vizing's conjecture for directed graphs BAB L. Niepel, A. Cerny Ars Combinatoria, 2009 | 4 | 2009 |
| On generalized words of Thue-Morse A Černý International Symposium on Mathematical Foundations of Computer Science, 232-239, 1984 | 4 | 1984 |
| Complexity and minimality of context-free grammars and languages A Černý International Symposium on Mathematical Foundations of Computer Science, 263-271, 1977 | 4 | 1977 |
| COUNTING SUBWORDS USING A TRIE AUTOMATON AČ HAMED M. K. ALAZEMI International Journal of Foundations of Computer Science (IJFCS), 2011 | 3* | 2011 |
| On fair words A Černý Journal of Automata, Languages and Combinatorics 14 (2), 163-174, 2009 | 3 | 2009 |
| On subword symmetry of words A ČERNÝ Int. J. Foun. Comp. Sci. 19 (01), 243-250, 2008 | 2 | 2008 |
