| Rhetorical Role Identification for Portuguese Legal Documents. | 0 | 0.34 | 2021 |
| New BSP/CGM algorithms for spanning trees | 0 | 0.34 | 2019 |
| Fix Sort: A Good Strategy to Perform Segmented Sorting | 0 | 0.34 | 2019 |
| A New Efficient Parallel Algorithm for Minimum Spanning Tree | 0 | 0.34 | 2018 |
| An experimental evaluation of a parallel simulated annealing approach for the 0-1 multidimensional knapsack problem. | 2 | 0.39 | 2018 |
| A Parallel Algorithm for Minimum Spanning Tree on GPU | 2 | 0.38 | 2017 |
| A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU | 0 | 0.34 | 2016 |
| Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. | 0 | 0.34 | 2016 |
| An Evaluation of Segmented Sorting Strategies on GPUs. | 0 | 0.34 | 2016 |
| Efficient Bsp/Cgm Algorithms For The Maximum Subsequence Sum And Related Problems | 1 | 0.36 | 2015 |
| Sequential And Parallel Implementation Of Grasp For The 0-1 Multidimensional Knapsack Problem | 1 | 0.35 | 2015 |
| Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model | 1 | 0.36 | 2014 |
| A parallel implementation to the multidimensional knapsack problem using augmented neural networks. | 1 | 0.41 | 2014 |
| A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization. | 8 | 0.55 | 2014 |
| Efficient representations of row-sorted 1-variant matrices for parallel string applications | 1 | 0.41 | 2007 |
| A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers | 3 | 0.42 | 2006 |
| 0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation | 3 | 0.43 | 2005 |
| A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components | 4 | 0.47 | 2004 |
| A Parallel Algorithm for Transitive Closure | 2 | 0.39 | 2002 |
