×

An off-line storage allocation algorithm. (English) Zbl 0653.68005


MSC:

68N25 Theory of operating systems
68Q25 Analysis of algorithms and problem complexity
68P05 Data structures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0286.68029
[2] M. Chrobak and M. Ślusarek, On some packing problem related to dynamic storage allocation, Submitted for publication.; M. Chrobak and M. Ślusarek, On some packing problem related to dynamic storage allocation, Submitted for publication. · Zbl 0675.68041
[3] Garey, M. R.; Johnson, D. S., Computers and Intractability (1979), Freeman: Freeman San Francisco, CA · Zbl 0411.68039
[4] Krogdahl, S., A dynamic storage allocation problem, Inform. Process. Lett., 2, 96-99 (1973) · Zbl 0268.68012
[5] Robson, J. M., Bounds for some functions concerning dynamic storage allocation, J. ACM, 21, 491-499 (1974) · Zbl 0285.68015
[6] Ślusarek, M., Computational complexity of storage allocation problems, (Ph.D. Thesis (1984), Warsaw University)
[7] Ślusarek, M., A note on the dynamic storage allocation problem, Inform. Process. Lett., 20, 223-227 (1985) · Zbl 0575.68032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.