Parallel approximation algorithms for bin packing

This publication has 9 references indexed in Scilit:

• Optimal parallel generation of a computation tree form
  ACM Transactions on Programming Languages and Systems, 1985
• A new proof for the first-fit decreasing bin-packing algorithm
  Journal of Algorithms, 1985
• The maximum flow problem is log space complete for P
  Theoretical Computer Science, 1982
• Bin packing can be solved within 1 + ε in linear time
  Combinatorica, 1981
• Parallel Prefix Computation
  Journal of the ACM, 1980
• Linear programming is log-space hard for P
  Information Processing Letters, 1979
• The circuit value problem is log space complete for P
  ACM SIGACT News, 1975
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
  SIAM Journal on Computing, 1974
• Parallel Processing with the Perfect Shuffle
  IEEE Transactions on Computers, 1971