{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:13Z","timestamp":1725489493589},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_34","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"421-428","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Spectrum Allocation: The Impotency of Duration Notification"],"prefix":"10.1007","author":[{"given":"Bala","family":"Kalyanasundaram","sequence":"first","affiliation":[]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"34_CR1","unstructured":"A. Borodin, and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/1025074","volume":"25","author":"E. Coffman","year":"1999","unstructured":"E. Coffman, \u201cAn introduction to combinatorial models of dynamic storage allocation\u201d, SIAM Review, 25, 311\u2013325, 1999.","journal-title":"SIAM Review"},{"key":"34_CR3","unstructured":"M. Garey and D. Johnson, Computers and Intractability: A Guide to NPcompleteness, W.H. Freeman and Company, 1979."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"J. Gergov, \u201cApproximation algorithms for dynamic storage allocation\u201d, European Symposium on Algorithms, 52\u201361, 1996.","DOI":"10.1007\/3-540-61680-2_46"},{"key":"34_CR5","unstructured":"J. Gergov, \u201cAlgorithms for compile-time memory allocation\u201d, ACM\/SIAM Symposium on Discrete Algorithms, S907\u2013S908, 1999."},{"issue":"4","key":"34_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0020-0190(73)90025-2","volume":"2","author":"S. Krogdahl","year":"1973","unstructured":"S. Krogdahl, \u201cA dynamic storage allocation problem\u201d, Information Processing Letters, 2(4), 96\u201399, 1973.","journal-title":"Information Processing Letters"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1137\/S089548019325647X","volume":"9","author":"M. Luby","year":"1996","unstructured":"M. Luby, J. Naor, A. Orda, \u201cTight Bounds for Dynamic Storage Allocation\u201d SIAM Journal of Discrete Mathematics, 9, 156\u2013166, 1996.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"J. Naor, A. Orda, and Y. Petruschka, \u201cDynamic storage allocation with known durations\u201d, European Symposium on Algorithms, 378\u2013387, 1997.","DOI":"10.1007\/3-540-63397-9_29"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/321650.321658","volume":"18","author":"J. Robson","year":"1971","unstructured":"J. Robson, \u201cAn estimate of the store size necessary for dynamic storage allocation\u201d, Journal of the ACM, 18, 416\u2013423, 1971.","journal-title":"Journal of the ACM"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/321832.321846","volume":"21","author":"J. Robson","year":"1974","unstructured":"J. Robson, \u201cBounds on some functions concerning dynamic storage allocation\u201d, Journal of the ACM, 21, 491\u2013499, 1974.","journal-title":"Journal of the ACM"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1093\/comjnl\/20.3.242","volume":"20","author":"J. Robson","year":"1977","unstructured":"J. Robson, \u201cWorst case fragmentation of first fit and best fit storage allocation strategies\u201d, Computer Journal, 20, 242\u2013244, 1977.","journal-title":"Computer Journal"},{"key":"34_CR12","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Dynamic storage allocation: a survey and critical review","author":"P. Wilson","year":"1995","unstructured":"P. Wilson, M. Johnstone, M. Neely, and D. Boles, \u201cDynamic storage allocation: a survey and critical review\u201d, International Workshop on Memory Management, Lecture Notes in Computer Science, 986, 1\u2013116, 1995."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"240","DOI":"10.2307\/2319522","volume":"81","author":"D. Woodall","year":"1974","unstructured":"D. Woodall, \u201cThe bay restaurant\u2019 a linear storage problem\u201d, American Mathematical Monthly, 81, 240\u2013246, 1974.","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T17:53:52Z","timestamp":1550771632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}