default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Cerný
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j20]Anton Cerný:
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms. Inf. Comput. 253: 424-435 (2017)- [j19]Zaid A. Hussain
, Bader F. AlBdaiwi, Anton Cerný:
Node-independent spanning trees in Gaussian networks. J. Parallel Distributed Comput. 109: 324-332 (2017) - [i2]Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný:
Node-Independent Spanning Trees in Gaussian Networks. CoRR abs/1701.02991 (2017) - 2016
- [j18]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-disjoint node-independent spanning trees in dense Gaussian networks. J. Supercomput. 72(12): 4718-4736 (2016) - [i1]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks. CoRR abs/1601.06915 (2016) - 2014
- [c7]Anton Cerný:
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms. LATA 2014: 273-284 - 2013
- [j17]Hamed M. K. Alazemi, Anton Cerný:
Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79(5): 658-668 (2013) - [j16]Anton Cerný:
On Prouhet's solution to the equal powers problem. Theor. Comput. Sci. 491: 33-46 (2013) - 2011
- [j15]Hamed M. K. Alazemi, Anton Cerný:
Counting subwords Using a Trie Automaton. Int. J. Found. Comput. Sci. 22(6): 1457-1469 (2011) - [j14]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): 3102-3110 (2011) - [c6]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 - 2010
- [j13]Anton Cerný:
Generalizations of Parikh mappings. RAIRO Theor. Informatics Appl. 44(2): 209-228 (2010)
2000 – 2009
- 2009
- [j12]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) - [j11]Anton Cerný:
On Fair Words. J. Autom. Lang. Comb. 14(2): 163-174 (2009) - 2008
- [j10]Ludovít Niepel, Anton Cerný:
Independence and Domination in Path Graphs of Trees. Comput. Informatics 27(4): 581-591 (2008) - [j9]Anton Cerný:
On Subword Symmetry of Words. Int. J. Found. Comput. Sci. 19(1): 243-250 (2008) - 2007
- [j8]Anton Cerný:
On fairness of D0L systems. Discret. Appl. Math. 155(13): 1769-1773 (2007) - 2003
- [c5]Mohamed Al-Ibrahim, Anton Cerný:
Proxy and Threshold One-Time Signatures. ACNS 2003: 123-136 - [c4]Mohamed Al-Ibrahim, Anton Cerný:
Authentication of Anycast Communication. MMM-ACNS 2003: 419-423 - 2002
- [j7]Anton Cerný:
Lyndon factorization of generalized words of Thue. Discret. Math. Theor. Comput. Sci. 5(1): 17-46 (2002) - 2001
- [j6]Anton Cerný:
On maximal premature partial Latin squares. Australas. J Comb. 24: 5-12 (2001)
1990 – 1999
- 1997
- [j5]Anton Cerný, Peter Horák, Walter D. Wallis:
Kirkman's school projects. Discret. Math. 167-168: 189-196 (1997) - [j4]Anton Cerný:
Optimal Description of Automatic Paperfolding Sequences. J. Univers. Comput. Sci. 3(10): 1085-1099 (1997) - [j3]Anton Cerný:
On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. Theor. Comput. Sci. 188(1-2): 161-174 (1997) - 1991
- [c3]Anton Cerný:
Generating Words by Cellular Automata. MFCS 1991: 113-120
1980 – 1989
- 1985
- [j2]Anton Cerný:
On A Class of Infinite Words with Bounded Repetitions. RAIRO Theor. Informatics Appl. 19(4): 337-349 (1985) - 1984
- [c2]Anton Cerný:
On Generalized Words of Thue-Morse. MFCS 1984: 232-239 - 1983
- [j1]Anton Cerný:
Descriptional complexity measures of context-free languages. Kybernetika 19(3): 237-247 (1983)
1970 – 1979
- 1977
- [c1]Anton Cerný:
Complexity and Minimality of Context-Free Grammars and Languages. MFCS 1977: 263-271
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
