OPT versus LOAD in dynamic storage allocation

Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. OPT versus LOAD in dynamic storage allocation. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 556-564, ACM, 2003. [doi]

@inproceedings{BuchsbaumKKRT03,
  title = {OPT versus LOAD in dynamic storage allocation},
  author = {Adam L. Buchsbaum and Howard J. Karloff and Claire Kenyon and Nick Reingold and Mikkel Thorup},
  year = {2003},
  doi = {10.1145/780542.780624},
  url = {http://doi.acm.org/10.1145/780542.780624},
  researchr = {https://researchr.org/publication/BuchsbaumKKRT03},
  cites = {0},
  citedby = {0},
  pages = {556-564},
  booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA},
  publisher = {ACM},
  isbn = {1-58113-674-9},
}