OpenAlex
PricingAboutJobs
Log inGet started
Work

Optimal parallel algorithm for the knapsack problem without memory conflicts

HTML

Year: 2004
Type: conference-paper
Source: International Scientific and Practical Conference of Students, Post-graduates and Young Scientists: Modern Techniques and Technology (MTT)
DOI: 10.1109/pdcat.2003.1236356
Authors: Kenli Li, Qinghua Li, Wang-Hui, Shengyi Jiang
Institution: Huazhong University of Science and Technology
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: knapsack problem, parallel algorithms, divide-and-conquer, shared memory, memory conflicts, optimal time complexity, ciphers, number theory

Open Access status: closed
OpenAlex ID: W3167312167
FWCI: 0.198
Cites: 18
Cited by: 3
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms