Tight Bounds for Dynamic Storage Allocation
From MaRDI portal
Publication:4875443
DOI10.1137/S089548019325647XzbMath0843.60014MaRDI QIDQ4875443
Michael Luby, Joseph (Seffi) Naor, Ariel Orda
Publication date: 13 August 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
memory managementon-line algorithmsinterval graphbandwidth allocationfirst fitdynamic storage allocation
Inequalities; stochastic orderings (60E15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)
Related Items (4)
A coloring problem for weighted graphs ⋮ Dynamic storage allocation with known durations ⋮ Reallocation problems in scheduling ⋮ Dynamic spectrum allocation: the impotency of duration notification.
This page was built for publication: Tight Bounds for Dynamic Storage Allocation
