default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis Antonio Brasil Kowada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki:
On total coloring the direct product of cycles and bipartite direct product of graphs. Discret. Math. 346(6): 113340 (2023)- [j14]Luiz Augusto G. Silva
, Luis Antonio Brasil Kowada, Maria Emília M. T. Walter:
A Barrier for Further Approximating Sorting by Transpositions. J. Comput. Biol. 30(12): 1277-1288 (2023) - [i9]Luiz Augusto G. da Silva, Luis Antonio Brasil Kowada, Maria Emília M. T. Walter:
A barrier for further approximating Sorting By Transpositions. CoRR abs/2304.13996 (2023) - 2022
- [j13]Luiz Augusto G. Silva, Luis Antonio Brasil Kowada, Noraí Romeu Rocco, Maria Emília M. T. Walter:
A new 1.375-approximation algorithm for sorting by transpositions. Algorithms Mol. Biol. 17(1): 1 (2022) - [c14]Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case. COCOON 2022: 212-219 - 2021
- [j12]Edinelço Dalcumune, Luis Antonio Brasil Kowada, André da Cunha Ribeiro, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino:
A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates. J. Univers. Comput. Sci. 27(6): 544-563 (2021) - [j11]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner:
A computational complexity comparative study of graph tessellation problems. Theor. Comput. Sci. 858: 81-89 (2021) - [c13]Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
How to detect whether Shor's algorithm succeeds against large integers without a quantum computer. LAGOS 2021: 145-151 - [c12]Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total coloring the direct product of complete graphs. LAGOS 2021: 306-314 - [i8]Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki:
Most direct product of graphs are Type 1. CoRR abs/2110.14453 (2021) - 2020
- [j10]Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
On the computational complexity of closest genome problems. Discret. Appl. Math. 274: 26-34 (2020) - [j9]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. Theor. Comput. Sci. 801: 175-191 (2020) - [e1]Luis Antonio Brasil Kowada, Daniel de Oliveira:
Advances in Bioinformatics and Computational Biology - 12th Brazilian Symposium on Bioinformatics, BSB 2019, Fortaleza, Brazil, October 7-10, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11347, Springer 2020, ISBN 978-3-030-46416-5 [contents] - [i7]Luiz Augusto G. Silva, Luis Antonio Brasil Kowada, Noraí Romeu Rocco, Maria Emília M. T. Walter:
An algebraic 1.375-approximation algorithm for the Transposition Distance Problem. CoRR abs/2001.11570 (2020)
2010 – 2019
- 2019
- [c11]Daniel Chicayban Bastos, Luis Antonio Brasil Kowada, Raphael C. S. Machado:
Measuring randomness in IoT products. MetroInd4.0&IoT 2019: 466-470 - [i6]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner:
The Tessellation Cover Number of Good Tessellable Graphs. CoRR abs/1908.10844 (2019) - 2018
- [c10]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. LATIN 2018: 1-13 - [c9]Luís Felipe I. Cunha, Yoan Diekmann, Luis Antonio Brasil Kowada, Jens Stoye:
Identifying Maximal Perfect Haplotype Blocks. BSB 2018: 26-37 - 2017
- [j8]Daniel Doerr, Luis Antonio Brasil Kowada, Eloi Araujo, Shachi Deshpande, Simone Dantas, Bernard M. E. Moret, Jens Stoye:
New Genome Similarity Measures based on Conserved Gene Adjacencies. J. Comput. Biol. 24(6): 616-634 (2017) - [c8]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. CPM 2017: 19:1-19:9 - [i5]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary RLE Strings. CoRR abs/1702.01280 (2017) - [i4]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The tessellation problem of quantum walks. CoRR abs/1705.09014 (2017) - [i3]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. CoRR abs/1712.07476 (2017) - 2016
- [j7]Alexandre Santiago de Abreu, Matheus Manzoli Ferreira, Luis Antonio Brasil Kowada, Franklin de Lima Marquezino:
QEDS: Um Simulador Clássico para Distinção de Elementos Quântico. RITA 23(2): 51-66 (2016) - [c7]Luis Antonio Brasil Kowada, Daniel Doerr, Simone Dantas, Jens Stoye:
New Genome Similarity Measures Based on Conserved Gene Adjacencies. RECOMB 2016: 204-224 - 2015
- [j6]C. S. Reis, Luis Antonio Brasil Kowada, Letícia Rodrigues Bueno, A. C. Ribeiro, Celina M. H. de Figueiredo:
Hamiltonian cycles in unitary prefix transposition rearrangement graphs. Discret. Appl. Math. 192: 82-86 (2015) - [j5]A. C. Ribeiro, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Celina M. H. de Figueiredo:
A new reversible circuit synthesis algorithm based on cycle representations of permutations. Electron. Notes Discret. Math. 50: 187-192 (2015) - [j4]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*. J. Comput. Biol. 22(11): 1044-1056 (2015) - [i2]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW 2015: 145-148 - 2014
- [c6]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. WABI 2014: 26-37 - 2013
- [j3]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Advancing the Transposition Distance and Diameter through Lonely Permutations. SIAM J. Discret. Math. 27(4): 1682-1709 (2013) - [c5]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. BSB 2013: 126-135 - 2012
- [c4]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Transposition Diameter and Lonely Permutations. BSB 2012: 1-12 - [i1]A. C. Ribeiro, Celina M. H. de Figueiredo, Franklin L. Marquezino, Luis Antonio Brasil Kowada:
Cayley graphs and analysis of quantum cost for reversible circuit synthesis. CoRR abs/1209.3275 (2012) - 2011
- [c3]Marcelo P. Lopes, Marília D. V. Braga, Celina M. H. de Figueiredo, Rodrigo de A. Hausen, Luis Antonio Brasil Kowada:
Analysis and Implementation of Sorting by Transpositions Using Permutation Trees. BSB 2011: 42-49 - 2010
- [j2]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada:
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Discret. Math. 24(3): 792-807 (2010) - [c2]Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Bounds on the Transposition Distance for Lonely Permutations. BSB 2010: 35-46
2000 – 2009
- 2008
- [c1]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada:
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. BSB 2008: 79-91 - 2006
- [j1]Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo:
Reversible Karatsuba's Algorithm. J. Univers. Comput. Sci. 12(5): 499-511 (2006)
Coauthor Index
aka: Celina Miraglia Herrera de Figueiredo
aka: Franklin de Lima Marquezino
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-04-25 05:57 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:
