Anton Cerný

Hamed M. K. Alazemi, Anton Cerný: Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79(5): 658-668 (2013)

Hamed M. K. Alazemi, Anton Cerný: Counting subwords Using a Trie Automaton. Int. J. Found. Comput. Sci. 22(6): 1457-1469 (2011)

Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi: Efficient Network Protection Design Models using Pre-Cross-Connected Trails. IEEE Transactions on Communications 59(11): 3102-3110 (2011)

Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi: Survivable Network Design Models Based on Pre-Cross-Connected Trails. ICCCN 2011: 1-7

Anton Cerný: Generalizations of Parikh mappings. RAIRO - Theor. Inf. and Applic. 44(2): 209-228 (2010)

Ludovít Niepel, Anton Cerný, Bader F. AlBdaiwi: Efficient domination in directed tori and the Vizing's conjecture for directed graphs. Ars Comb. 91 (2009)

Anton Cerný: On Fair Words. Journal of Automata, Languages and Combinatorics 14(2): 163-174 (2009)

Ludovít Niepel, Anton Cerný: Independence and Domination in Path Graphs of Trees. Computing and Informatics 27(4): 581-591 (2008)

Anton Cerný: On Subword Symmetry of Words. Int. J. Found. Comput. Sci. 19(1): 243-250 (2008)

Anton Cerný: On fairness of D0L systems. Discrete Applied Mathematics 155(13): 1769-1773 (2007)

Mohamed Al-Ibrahim, Anton Cerný: Proxy and Threshold One-Time Signatures. ACNS 2003: 123-136

Mohamed Al-Ibrahim, Anton Cerný: Authentication of Anycast Communication. MMM-ACNS 2003: 419-423

Anton Cerný: Lyndon factorization of generalized words of Thue. Discrete Mathematics & Theoretical Computer Science 5(1): 17-46 (2002)

Anton Cerný, Peter Horák, Walter D. Wallis: Kirkman's school projects. Discrete Mathematics 167-168: 189-196 (1997)

Anton Cerný: Optimal Description of Automatic Paperfolding Sequences. J. UCS 3(10): 1085-1099 (1997)

Anton Cerný: On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. Theor. Comput. Sci. 188(1-2): 161-174 (1997)

Anton Cerný: Generating Words by Cellular Automata. MFCS 1991: 113-120

Anton Cerný: On A Class of Infinite Words with Bounded Repetitions. ITA 19(4): 337-349 (1985)

Anton Cerný: On Generalized Words of Thue-Morse. MFCS 1984: 232-239

Anton Cerný: Complexity and Minimality of Context-Free Grammars and Languages. MFCS 1977: 263-271