Carlos Alberto Alonso Sanches

12 papers Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
An improved balanced algorithm for the subset-sum problem.
Eur. J. Oper. Res.
Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches
2017 J jnl
A low-space algorithm for the subset-sum problem on GPU.
Comput. Oper. Res.
Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches
2016 J jnl
A general resolution of intractable problems in polynomial time through DNA Computing.
Biosyst.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma
2016 J jnl
An efficient solution to the
Concurr. Comput. Pract. Exp.
Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches
2014 J jnl
A computational DNA solution approach for the Quadratic Diophantine Equation.
Appl. Math. Comput.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma
2010 J jnl
Observations on optimal parallelizations of two-list algorithm.
Parallel Comput.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse
2009 J jnl
A polynomial-time DNA computing solution for the Bin-Packing Problem.
Appl. Math. Comput.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma
2008 J jnl
Parallel time and space upper-bounds for the subset-sum problem.
Theor. Comput. Sci.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse
2007 J jnl
An optimal and scalable parallelization of the two-list.
Eur. J. Oper. Res.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse
2003 — —
Algoritmos paralelos para o problema da mochila.
Carlos Alberto Alonso Sanches
2002 J jnl
Comments on parallel algorithms for the knapsack problem.
Parallel Comput.
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse
1994 — conf
SIMD Algorithms for Matrix Multiplication on the Hypercube.
IPPS
Carlos Alberto Alonso Sanches, S. W. Song