| |
| 2008 | ||
|---|---|---|
| 12 | EE | Anton Cerný: On Subword Symmetry of Words. Int. J. Found. Comput. Sci. 19(1): 243-250 (2008) |
| 2007 | ||
| 11 | EE | Anton Cerný: On fairness of D0L systems. Discrete Applied Mathematics 155(13): 1769-1773 (2007) |
| 2003 | ||
| 10 | EE | Mohamed Al-Ibrahim, Anton Cerný: Proxy and Threshold One-Time Signatures. ACNS 2003: 123-136 |
| 9 | EE | Mohamed Al-Ibrahim, Anton Cerný: Authentication of Anycast Communication. MMM-ACNS 2003: 419-423 |
| 2002 | ||
| 8 | EE | Anton Cerný: Lyndon factorization of generalized words of Thue. Discrete Mathematics & Theoretical Computer Science 5(1): 17-46 (2002) |
| 1997 | ||
| 7 | EE | Anton Cerný, Peter Horák, Walter D. Wallis: Kirkman's school projects. Discrete Mathematics 167-168: 189-196 (1997) |
| 6 | EE | Anton Cerný: Optimal Description of Automatic Paperfolding Sequences. J. UCS 3(10): 1085-1099 (1997) |
| 5 | EE | Anton Cerný: On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. Theor. Comput. Sci. 188(1-2): 161-174 (1997) |
| 1991 | ||
| 4 | Anton Cerný: Generating Words by Cellular Automata. MFCS 1991: 113-120 | |
| 1985 | ||
| 3 | Anton Cerný: On A Class of Infinite Words with Bounded Repetitions. ITA 19(4): 337-349 (1985) | |
| 1984 | ||
| 2 | Anton Cerný: On Generalized Words of Thue-Morse. MFCS 1984: 232-239 | |
| 1977 | ||
| 1 | Anton Cerný: Complexity and Minimality of Context-Free Grammars and Languages. MFCS 1977: 263-271 | |
| 1 | Mohamed Al-Ibrahim | [9] [10] |
| 2 | Peter Horák | [7] |
| 3 | Walter D. Wallis (W. D. Wallis) | [7] |