External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit

Walter Knödel. A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit. In Jozef Gruska, Michal Chytil, editors, Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings. Volume 118 of Lecture Notes in Computer Science, pages 369-378, Springer, 1981.

Abstract

Abstract is missing.

runs on