Anton Cerný

According to our database1, Anton Cerný authored at least 27 papers between 1977 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Node-independent spanning trees in Gaussian networks.
J. Parallel Distributed Comput., 2017

Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms.
Inf. Comput., 2017

2016
Edge-disjoint node-independent spanning trees in dense Gaussian networks.
J. Supercomput., 2016

2014
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
On Prouhet's solution to the equal powers problem.
Theor. Comput. Sci., 2013

Several extensions of the Parikh matrix L-morphism.
J. Comput. Syst. Sci., 2013

2011
Efficient Network Protection Design Models using Pre-Cross-Connected Trails.
IEEE Trans. Commun., 2011

Counting subwords Using a Trie Automaton.
Int. J. Found. Comput. Sci., 2011

Survivable Network Design Models Based on Pre-Cross-Connected Trails.
Proceedings of 20th International Conference on Computer Communications and Networks, 2011

2010
Generalizations of Parikh mappings.
RAIRO Theor. Informatics Appl., 2010

2009
On Fair Words.
J. Autom. Lang. Comb., 2009

Efficient domination in directed tori and the Vizing's conjecture for directed graphs.
Ars Comb., 2009

2008
On Subword Symmetry of Words.
Int. J. Found. Comput. Sci., 2008

Independence and Domination in Path Graphs of Trees.
Comput. Informatics, 2008

2007
On fairness of D0L systems.
Discret. Appl. Math., 2007

2003
Authentication of Anycast Communication.
Proceedings of the Computer Network Security, 2003

Proxy and Threshold One-Time Signatures.
Proceedings of the Applied Cryptography and Network Security, 2003

2002
Lyndon factorization of generalized words of Thue.
Discret. Math. Theor. Comput. Sci., 2002

2001
On maximal premature partial Latin squares.
Australas. J Comb., 2001

1997
On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings.
Theor. Comput. Sci., 1997

Optimal Description of Automatic Paperfolding Sequences.
J. Univers. Comput. Sci., 1997

Kirkman's school projects.
Discret. Math., 1997

1991
Generating Words by Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1985
On A Class of Infinite Words with Bounded Repetitions.
RAIRO Theor. Informatics Appl., 1985

1984
On Generalized Words of Thue-Morse.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
Descriptional complexity measures of context-free languages.
Kybernetika, 1983

1977
Complexity and Minimality of Context-Free Grammars and Languages.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977


  Loading...