Anton Cerný

Publication Activity (10 Years)

Years Active: 1977-2017
Publications (10 Years): 5

Top Topics

Undirected Graph

Minimum Total Cost

Overlapping Communities

Top Venues

J. Comput. Syst. Sci.

J. Parallel Distributed Comput.

Publications

Zaid Hussain, Bader F. AlBdaiwi, Anton Cerný
Node-independent spanning trees in Gaussian networks. J. Parallel Distributed Comput. 109 (2017)
Zaid Hussain, Bader F. AlBdaiwi, Anton Cerný
Node-Independent Spanning Trees in Gaussian Networks. CoRR (2017)
Anton Cerný
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms. Inf. Comput. 253 (2017)
Bader F. AlBdaiwi, Zaid Hussain, Anton Cerný, Robert E. L. Aldred
Edge-disjoint node-independent spanning trees in dense Gaussian networks. J. Supercomput. 72 (12) (2016)
Bader F. AlBdaiwi, Zaid Hussain, Anton Cerný, Robert E. L. Aldred
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks. CoRR (2016)
Anton Cerný
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms. LATA (2014)
Hamed M. K. Alazemi, Anton Cerný
Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79 (5) (2013)
Anton Cerný
On Prouhet's solution to the equal powers problem. Theor. Comput. Sci. 491 (2013)
Hamed M. K. Alazemi, Anton Cerný
Counting subwords Using a Trie Automaton. Int. J. Found. Comput. Sci. 22 (6) (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)
Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi
Efficient Network Protection Design Models using Pre-Cross-Connected Trails. IEEE Trans. Commun. 59 (11) (2011)
Anton Cerný
Generalizations of Parikh mappings. RAIRO Theor. Informatics Appl. 44 (2) (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. J. Autom. Lang. Comb. 14 (2) (2009)
Anton Cerný
On Subword Symmetry of Words. Int. J. Found. Comput. Sci. 19 (1) (2008)
Ludovít Niepel, Anton Cerný
Independence and Domination in Path Graphs of Trees. Comput. Informatics 27 (4) (2008)
Anton Cerný
On fairness of D0L systems. Discret. Appl. Math. 155 (13) (2007)
Mohamed Al-Ibrahim, Anton Cerný
Proxy and Threshold One-Time Signatures. ACNS (2003)
Mohamed Al-Ibrahim, Anton Cerný
Authentication of Anycast Communication. MMM-ACNS (2003)
Anton Cerný
Lyndon factorization of generalized words of Thue. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Anton Cerný
On maximal premature partial Latin squares. Australas. J Comb. 24 (2001)
Anton Cerný
On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. Theor. Comput. Sci. 188 (1-2) (1997)
Anton Cerný, Peter Horák, Walter D. Wallis
Kirkman's school projects. Discret. Math. (1997)
Anton Cerný
Optimal Description of Automatic Paperfolding Sequences. J. Univers. Comput. Sci. 3 (10) (1997)
Anton Cerný
Generating Words by Cellular Automata. MFCS (1991)
Anton Cerný
On A Class of Infinite Words with Bounded Repetitions. RAIRO Theor. Informatics Appl. 19 (4) (1985)
Anton Cerný
On Generalized Words of Thue-Morse. MFCS (1984)
Anton Cerný
Descriptional complexity measures of context-free languages. Kybernetika 19 (3) (1983)
Anton Cerný
Complexity and Minimality of Context-Free Grammars and Languages. MFCS (1977)