default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenrique Mongelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Awdren L. Fontão
, Edson Matsubara, Henrique Mongelli, Marcio Medeiros, Carlos Lourenço, Henrique Martins, Igor Cortez, Maria Borges:
Hyacinth macaw: a project-based learning program to develop talents in Software Engineering for Artificial Intelligence. SBES 2023: 312-321
2010 – 2019
- 2019
- [j4]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme Luiz Szwarcfiter:
New BSP/CGM algorithms for spanning trees. Int. J. High Perform. Comput. Appl. 33(3) (2019) - 2018
- [c9]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song:
A New Efficient Parallel Algorithm for Minimum Spanning Tree. SBAC-PAD 2018: 107-114 - [c8]Lucas Arakaki Takemoto, Bianca de Almeida Dantas, Henrique Mongelli:
A Parallel Approach of Simulated Annealing Using GPGPU to Solve the Quadratic Assignment Problem. WSCAD 2018: 23-29 - 2017
- [c7]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song:
A Parallel Algorithm for Minimum Spanning Tree on GPU. SBAC-PAD (Workshops) 2017: 67-72 - 2014
- [c6]Henrique Fingler, Edson Norberto Cáceres, Henrique Mongelli, Siang W. Song:
A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization. ICCS 2014: 84-94 - 2012
- [c5]Edson Norberto Cáceres, Henrique Fingler, Henrique Mongelli, Siang Wun Song:
Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU. ICPP Workshops 2012: 314-322 - 2010
- [j3]E. N. Cáceres, Henrique Mongelli, L. Loureiro, Christiane Nishibe, Siang Wun Song:
Performance results of running parallel applications on the InteGrade. Concurr. Comput. Pract. Exp. 22(3): 375-393 (2010) - [c4]Edson Norberto Cáceres, Henrique Mongelli, Christiane Nishibe, Siang Wun Song:
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. HPCS 2010: 631-637
2000 – 2009
- 2004
- [c3]Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter:
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. Euro-Par 2004: 828-831 - [c2]Erik J. Hanashiro, Henrique Mongelli, Siang W. Song:
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. WEA 2004: 253-268 - 2001
- [j2]Henrique Mongelli, Siang W. Song:
Parallel Pattern Matching with Scaling. Parallel Process. Lett. 11(1): 125-138 (2001) - 2000
- [b1]Henrique Mongelli:
Algoritmos CGM para Busca Uni e Bidimensional de Padrões com e sem Escala. Federal University of Mato Grosso do Sul, Brazil, 2000
1990 – 1999
- 1999
- [j1]Henrique Mongelli, Siang W. Song:
Parallel Range Minima on Coarse Grained Multicomputers. Int. J. Found. Comput. Sci. 10(4): 375-390 (1999) - [c1]Henrique Mongelli, Siang W. Song:
A Range Minima Parallel Algorithm for Coarse Grained Multicomputers. IPPS/SPDP Workshops 1999: 1075-1084
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-04-25 05:47 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:
