OPT versus LOAD in dynamic storage allocation

DOI10.1145/780542.780624zbMath1192.68311OpenAlexW1979965772MaRDI QIDQ3581277

Mikkel Thorup, Nick Reingold, Claire M. Kenyon, Howard J. Karloff, Adam L. Buchsbaum

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780624

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Single and multiple device DSA problems, complexities and online algorithms

This page was built for publication: OPT versus LOAD in dynamic storage allocation