Edson Cáceres

According to our database1, Edson Cáceres authored at least 44 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
New BSP/CGM algorithms for spanning trees.
Int. J. High Perform. Comput. Appl., 2019

2018
An experimental evaluation of a parallel simulated annealing approach for the 0-1 multidimensional knapsack problem.
J. Parallel Distributed Comput., 2018

A New Efficient Parallel Algorithm for Minimum Spanning Tree.
Proceedings of the 30th International Symposium on Computer Architecture and High Performance Computing, 2018

2017
A Parallel Algorithm for Minimum Spanning Tree on GPU.
Proceedings of the 2017 International Symposium on Computer Architecture and High Performance Computing Workshops, 2017

2016
Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA.
J. Braz. Comput. Soc., 2016

A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU.
Proceedings of the 28th International Symposium on Computer Architecture and High Performance Computing, 2016

Sequential and Parallel Hybrid Approaches of Augmented Neural Networks and GRASP for the 0-1 Multidimensional Knapsack Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

An Evaluation of Segmented Sorting Strategies on GPUs.
Proceedings of the 18th IEEE International Conference on High Performance Computing and Communications; 14th IEEE International Conference on Smart City; 2nd IEEE International Conference on Data Science and Systems, 2016

2015
Efficient BSP/CGM Algorithms for the Maximum Subarray Sum and Related Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems1.
Proceedings of the International Conference on Computational Science, 2015

Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem.
Proceedings of the International Conference on Computational Science, 2015

2014
Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model.
Proceedings of the 2014 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2014

A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization.
Proceedings of the International Conference on Computational Science, 2014

A parallel implementation to the multidimensional knapsack problem using augmented neural networks.
Proceedings of the XL Latin American Computing Conference, 2014

2013
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds.
IEEE Trans. Parallel Distrib. Syst., 2013

Parallel transitive closure algorithm.
J. Braz. Comput. Soc., 2013

2012
Phylogenetic Distance Computation Using CUDA.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU.
Proceedings of the 41st International Conference on Parallel Processing Workshops, 2012

2010
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search.
RAIRO - Theor. Inf. and Applic., 2010

Performance results of running parallel applications on the InteGrade.
Concurr. Comput. Pract. Exp., 2010

Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

2007
Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2007

2006
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
Algorithmica, 2006

A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
An all-substrings common subsequence algorithm.
Electron. Notes Discret. Math., 2005

0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

2004
Revisiting a BSP/CGM Transitive Closure Algorithm.
Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2004), 2004

BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Computing Maximum Subsequence in Parallel.
Proceedings of the II Brazilian Workshop on Bioinformatics, 2003

A BSP/CGM Algorithm for Computing Euler Tours in Graphs.
Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 2003

Comparison of Genomes Using High-Performance Parallel Computing.
Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 2003

Efficient Parallel Implementation of Transitive Closure of Digraphs.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison.
Proceedings of the Computational Science and Its Applications, 2003

2002
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
Algorithmica, 2002

A CGM/BSP Parallel Similarity Algorithm.
Proceedings of the I Brazilian Workshop on Bioinformatics, 2002

Parallel dynamic programming for solving the string editing problem on a CGM/BSP.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

A Parallel Algorithm for Transitive Closure.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

2001
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Coarse Grained Parallel Graph Planarity Testing.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1997
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1993
On Finding Euler Tours in Parallel.
Parallel Process. Lett., 1993


  Loading...