%0 Journal Article %1 journals/jcst/LiLL04 %A Li, Kenli %A Li, Renfa %A Li, Qing-Hua %D 2004 %J J. Comput. Sci. Technol. %K dblp %N 6 %P 760-768 %T Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts. %U http://dblp.uni-trier.de/db/journals/jcst/jcst19.html#LiLL04 %V 19

@article{journals/jcst/LiLL04, added-at = {2020-10-15T00:00:00.000+0200}, author = {Li, Kenli and Li, Renfa and Li, Qing-Hua}, biburl = {https://www.bibsonomy.org/bibtex/2e2a2980a6158f5bd2809bd93e9445689/dblp}, ee = {https://doi.org/10.1007/BF02973436}, interhash = {eeddbc19966c7efed63efb399bc95f99}, intrahash = {e2a2980a6158f5bd2809bd93e9445689}, journal = {J. Comput. Sci. Technol.}, keywords = {dblp}, number = 6, pages = {760-768}, timestamp = {2020-10-16T11:34:24.000+0200}, title = {Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts.}, url = {http://dblp.uni-trier.de/db/journals/jcst/jcst19.html#LiLL04}, volume = 19, year = 2004 }