Bounds for Some Functions Concerning Dynamic Storage Allocation
From MaRDI portal
Cited in
(8)- An off-line storage allocation algorithm
- A constant-time dynamic storage allocator for real-time systems
- Storage allocation is NP-hard
- Dynamic storage allocation with known durations
- On the worst case performance of buddy systems
- A note on the dynamic storage allocation problem
- On some packing problem related to dynamic storage allocation
- Dynamic spectrum allocation: the impotency of duration notification.
This page was built for publication: Bounds for Some Functions Concerning Dynamic Storage Allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4772703)