Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Luis Antonio Brasil Kowada"'
Autor:
Edinelço Dalcumune, Luis Antonio Brasil Kowada, André da Cunha Ribeiro, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino
Publikováno v:
Journal of Universal Computer Science, Vol 27, Iss 6, Pp 544-563 (2021)
We present a new algorithm for synthesis of reversible circuits for arbitrary n-bit bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we u
Externí odkaz:
https://doaj.org/article/10f8e42d094d4a4685de39a3601001ab
Autor:
Franklin de Lima Marquezino, Edinelço Dalcumune, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo, A. C. Ribeiro
Publikováno v:
Journal of Universal Computer Science, Vol 27, Iss 6, Pp 544-563 (2021)
JUCS-Journal of Universal Computer Science 27(6): 544-563
JUCS-Journal of Universal Computer Science 27(6): 544-563
We present a new algorithm for synthesis of reversible circuits for arbitrary n-bit bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dee90550713f308f96d91c8a4225fc02
https://doi.org/10.3897/jucs.69617
https://doi.org/10.3897/jucs.69617
Autor:
Luís Felipe I. Cunha, Franklin de Lima Marquezino, Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo, Daniel Posner, Alexandre Santiago de Abreu
Publikováno v:
Theoretical Computer Science. 858:81-89
A tessellation of a graph is a partition of its vertices into cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges, and the tessellation cover number, denoted by T ( G ) , is the size of a smallest tessellat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dd24f145cf69daafa95f58a726c01de
https://doi.org/10.1016/j.tcs.2020.11.045
https://doi.org/10.1016/j.tcs.2020.11.045
Publikováno v:
Procedia Computer Science. 195:145-151
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6f8730cf13d4a164eea1710b4aabcde
https://doi.org/10.1016/j.procs.2021.11.020
https://doi.org/10.1016/j.procs.2021.11.020
Autor:
Vinícius Fernandes dos Santos, Pedro Feijão, Luis Antonio Brasil Kowada, Luís Felipe I. Cunha, Celina M. H. de Figueiredo
Publikováno v:
Discrete Applied Mathematics. 274:26-34
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics. Many pairwise rearrangement distances have been proposed, based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c15af1bdaf60f2744998c5a5674ec861
https://doi.org/10.1016/j.dam.2019.04.002
https://doi.org/10.1016/j.dam.2019.04.002
Autor:
Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo, Franklin de Lima Marquezino, Edinelço Dalcumune
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
One of the main motivations for reversible computing is that quantum computing has as one of its foundations the reversibility of all gates, that is, quantum computing circuit models are reversible. An important problem in reversible computing that h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0419c8e233b08abe96821cc2e6d01da
https://doi.org/10.5753/etc.2021.16385
https://doi.org/10.5753/etc.2021.16385
Autor:
Diane Castonguay, Luis Antonio Brasil Kowada, A. C. Ribeiro, Caroline Reis Patrão, Celina M. H. de Figueiredo
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC).
The family of graphs H,p has been defined in the context of edge partitions. The established properties such as vertex transitivity and low diameter suggest this family as a good topology for the design of interconnection networks. The vertices of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0426e8a2808ee028ba6d41058a28c3d
https://doi.org/10.5753/etc.2019.6395
https://doi.org/10.5753/etc.2019.6395
Publikováno v:
MetroInd4.0&IoT
Choosing and using a random number generator is no simple task. Most random number generators fail statistical tests, revealing patterns in their output. Good generators can lead to disasters if not properly seeded. IoT products may not afford safe r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0eeea595fc8875b0395effc70450fa47
https://doi.org/10.1109/metroi4.2019.8792883
https://doi.org/10.1109/metroi4.2019.8792883
Publikováno v:
ACTA IMEKO. 9:128
Statistical sampling and simulations produced by algorithms require fast random number generators; however, true random number generators are often too slow for the purpose, so pseudorandom number generators are usually more suitable. But choosing an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a252a3eaaf2ea65d5aac48c23bf9cfb9
https://doi.org/10.21014/acta_imeko.v9i4.730
https://doi.org/10.21014/acta_imeko.v9i4.730
Autor:
Franklin de Lima Marquezino, Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo, Daniel Posner, Luís Felipe I. Cunha, Tharso D. Fernandes, Alexandre Santiago de Abreu
Publikováno v:
LATIN 2018: Theoretical Informatics ISBN: 9783319774039
LATIN
LATIN
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The t-tessellability problem aims to decide whether there is a tessellation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c3df1a31c1fafa42dee0f9acfde5d55
https://doi.org/10.1007/978-3-319-77404-6_1
https://doi.org/10.1007/978-3-319-77404-6_1
