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.
@inproceedings{Knodel81,
title = {A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit},
author = {Walter Knödel},
year = {1981},
researchr = {https://researchr.org/publication/Knodel81},
cites = {0},
citedby = {0},
pages = {369-378},
booktitle = {Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings},
editor = {Jozef Gruska and Michal Chytil},
volume = {118},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-10856-4},
}