Anton Cerný - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2017

Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphismsAnton Cerný. iandc, 253:424-435, 2017. [doi]

Node-independent spanning trees in Gaussian networksZaid Hussain, Bader F. AlBdaiwi, Anton Cerný. jpdc, 109:324-332, 2017. [doi]

2016

Edge-disjoint node-independent spanning trees in dense Gaussian networksBader F. AlBdaiwi, Zaid Hussain, Anton Cerný, Robert Aldred. tjs, 72(12):4718-4736, 2016. [doi]

2014

Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular MorphismsAnton Cerný. LATA 2014: 273-284 [doi]

2013

Several extensions of the Parikh matrix L-morphismHamed M. K. Alazemi, Anton Cerný. jcss, 79(5):658-668, 2013. [doi]

On Prouhet's solution to the equal powers problemAnton Cerný. TCS, 491:33-46, 2013. [doi]

2011

2010

Generalizations of Parikh mappingsAnton Cerný. ita, 44(2):209-228, 2010. [doi]

2009

On Fair WordsAnton Cerný. jalc, 14(2):163-174, 2009.

Efficient domination in directed tori and the Vizing's conjecture for directed graphsLudovít Niepel, Anton Cerný, Bader F. AlBdaiwi. arscom, 91, 2009.

2008

On Subword Symmetry of WordsAnton Cerný. ijfcs, 19(1):243-250, 2008. [doi]

Independence and Domination in Path Graphs of TreesLudovít Niepel, Anton Cerný. cai, 27(4):581-591, 2008. [doi]

2007

On fairness of D0L systemsAnton Cerný. DAM, 155(13):1769-1773, 2007. [doi]

2003

Proxy and Threshold One-Time SignaturesMohamed Al-Ibrahim, Anton Cerný. acns 2003: 123-136 [doi]

Authentication of Anycast CommunicationMohamed Al-Ibrahim, Anton Cerný. mmmacns 2003: 419-423 [doi]

2002

Lyndon factorization of generalized words of ThueAnton Cerný. dmtcs, 5(1):17-46, 2002. [doi]

2001

On maximal premature partial Latin squaresAnton Cerný. ajc, 24:5-12, 2001. [doi]

1997

On Sequences Resulting from Iteration of Modified Quadratic and Palindromic MappingsAnton Cerný. TCS, 188(1-2):161-174, 1997. [doi]

Optimal Description of Automatic Paperfolding SequencesAnton Cerný. jucs, 3(10):1085-1099, 1997. [doi]

Kirkman s school projectsAnton Cerný, Peter Horák, Walter D. Wallis. DM, 167-168:189-196, 1997. [doi]

1991

Generating Words by Cellular AutomataAnton Cerný. mfcs 1991: 113-120

1985

On A Class of Infinite Words with Bounded RepetitionsAnton Cerný. ita, 19(4):337-349, 1985.

1984

On Generalized Words of Thue-MorseAnton Cerný. mfcs 1984: 232-239

1983

Descriptional complexity measures of context-free languagesAnton Cerný. kybernetika, 19(3):237-247, 1983. [doi]

1977

Complexity and Minimality of Context-Free Grammars and LanguagesAnton Cerný. mfcs 1977: 263-271

Sign in or sign up to see more results.

runs on WebDSL