Friday, October 29, 2010

At last! The opportunity to read the thesis by David Stifler Johnson

This link has made possible for everyone to read very important PhD thesis in combinatorial optimization and worst-case analysis. Namely, the thesis by David Stifler Johnson named "Near-optimal bin packing algorithms". I hope in the near future we'll be able to take a look at such important papers in bin packing theory as:
  1. The performance of a memory allocation algorithm by Jeffrey David Ullman
  2. A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms by Donna J Brown
Not on bin packing, however, important and not available on the net paper is
    The Intrinsic Computational Difficulty of Functions by Alan Cobham.