Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Anton Cerny"'
Message broadcasting in networks can be efficiently carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at the same node r . Second, for every node
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c4f20e31adbb6aea4bb0be52afb97e7
http://arxiv.org/abs/1701.02991
http://arxiv.org/abs/1701.02991
Publikováno v:
IEEE Transactions on Communications. 59:3102-3110
Network survivability is a key design issue for optical transport mesh networks. Various survivability schemes have been introduced among which p-cycle has (and continues) attracted quite a lot of attention because of its fast and efficient protectio
Publikováno v:
ICCCN
Survivability is a key issue in the design of optical mesh networks. Various survivability schemes have been introduced among which p-cycle has been attracting quite a lot of attention because of its fast and efficient protection capability. The conc
Autor:
Anton Cerny, Mohamed Al-Ibrahim
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783540202080
ACNS
ACNS
One-time signatures are an important and efficient authentication utility. Various schemes already exist for the classical one-way public-key cryptography. One-time signatures have not been sufficiently explored in the literature in the branch of soc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15bd9a8a108b4eb10377df6582f89661
https://doi.org/10.1007/978-3-540-45203-4_10
https://doi.org/10.1007/978-3-540-45203-4_10
Autor:
Anton Cerny, Mohamed Al-Ibrahim
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540407973
MMM-ACNS
MMM-ACNS
Anycast is a communication mode in which the same address is assigned to a group of servers and a request sent for a service is routed to the “best” server. The measure of best could be the number of hops, available bandwidth, load of the server,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5f503edb8247c81416732965b65dbb8
https://doi.org/10.1007/978-3-540-45215-7_36
https://doi.org/10.1007/978-3-540-45215-7_36
Autor:
Anton Černý
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
The i-th symbol of the well-known infinite word of Thue on the alphabet { 0,1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of o
Externí odkaz:
https://doaj.org/article/edea316ef9204cf9993f893e8ee7a907
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.