Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on the dynamic storage allocation problem

From MaRDI portal
Publication:1064060
Jump to:navigation, search

DOI10.1016/0020-0190(85)90023-7zbMath0575.68032OpenAlexW2126515434MaRDI QIDQ1064060

Maciej Ślusarek

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90023-7


zbMATH Keywords

approximation algorithmresource allocationcombinatorial problemsdynamic storage allocation


Mathematics Subject Classification ID

Theory of operating systems (68N25)


Related Items (1)

An off-line storage allocation algorithm




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • An Introduction to Combinatorial Models of Dynamic Storage Allocation
  • Bounds for Some Functions Concerning Dynamic Storage Allocation




This page was built for publication: A note on the dynamic storage allocation problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1064060&oldid=13086613"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki