Anton Cerný

29 papers B 5C 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
Node-Independent Spanning Trees in Gaussian Networks.
CoRR
Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný
2017 J jnl
Node-independent spanning trees in Gaussian networks.
J. Parallel Distributed Comput.
Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný
2017 J jnl
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms.
Inf. Comput.
Anton Cerný
2016 J jnl
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks.
CoRR
Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred
2016 J jnl
Edge-disjoint node-independent spanning trees in dense Gaussian networks.
J. Supercomput.
Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred
2014 C conf
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms.
LATA
Anton Cerný
2013 J jnl
On Prouhet's solution to the equal powers problem.
Theor. Comput. Sci.
Anton Cerný
2013 J jnl
Several extensions of the Parikh matrix L-morphism.
J. Comput. Syst. Sci.
Hamed M. K. Alazemi, Anton Cerný
2011 J jnl
Counting subwords Using a Trie Automaton.
Int. J. Found. Comput. Sci.
Hamed M. K. Alazemi, Anton Cerný
2011 J jnl
Efficient Network Protection Design Models using Pre-Cross-Connected Trails.
IEEE Trans. Commun.
Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi
2011 B conf
Survivable Network Design Models Based on Pre-Cross-Connected Trails.
ICCCN
Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi
2010 J jnl
Generalizations of Parikh mappings.
RAIRO Theor. Informatics Appl.
Anton Cerný
2009 J jnl
Efficient domination in directed tori and the Vizing's conjecture for directed graphs.
Ars Comb.
Ludovít Niepel, Anton Cerný, Bader F. AlBdaiwi
2009 J jnl
On Fair Words.
J. Autom. Lang. Comb.
Anton Cerný
2008 J jnl
Independence and Domination in Path Graphs of Trees.
Comput. Informatics
Ludovít Niepel, Anton Cerný
2008 J jnl
On Subword Symmetry of Words.
Int. J. Found. Comput. Sci.
Anton Cerný
2007 J jnl
On fairness of D0L systems.
Discret. Appl. Math.
Anton Cerný
2003 — conf
Authentication of Anycast Communication.
MMM-ACNS
Mohamed Al-Ibrahim, Anton Cerný
2003 B conf
Proxy and Threshold One-Time Signatures.
ACNS
Mohamed Al-Ibrahim, Anton Cerný
2002 J jnl
Lyndon factorization of generalized words of Thue.
Discret. Math. Theor. Comput. Sci.
Anton Cerný
2001 J jnl
On maximal premature partial Latin squares.
Australas. J Comb.
Anton Cerný
1997 J jnl
Kirkman's school projects.
Discret. Math.
Anton Cerný, Peter Horák, Walter D. Wallis
1997 J jnl
On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings.
Theor. Comput. Sci.
Anton Cerný
1997 J jnl
Optimal Description of Automatic Paperfolding Sequences.
J. Univers. Comput. Sci.
Anton Cerný
1991 B conf
Generating Words by Cellular Automata.
MFCS
Anton Cerný
1985 J jnl
On A Class of Infinite Words with Bounded Repetitions.
RAIRO Theor. Informatics Appl.
Anton Cerný
1984 B conf
On Generalized Words of Thue-Morse.
MFCS
Anton Cerný
1983 J jnl
Descriptional complexity measures of context-free languages.
Kybernetika
Anton Cerný
1977 B conf
Complexity and Minimality of Context-Free Grammars and Languages.
MFCS
Anton Cerný