{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:08:05Z","timestamp":1725538085090},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_3","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"14-25","source":"Crossref","is-referenced-by-count":1,"title":["Maintaining Arrays of Contiguous Objects"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Kamphans","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Schweer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Kamphans, T., Schweer, N., Tessars, C., van der Veen, J.C., Angermeier, J., Koch, D., Teich, J.: No-break dynamic defragmentation of reconfigurable devices. In: Proc. Internat. Conf. Field Program. Logic Appl. (FPL 2008) (2008)","DOI":"10.1109\/FPL.2008.4629917"},{"key":"3_CR2","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn., vol.\u00a01. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/S089548019325647X","volume":"9","author":"M.G. Luby","year":"1996","unstructured":"Luby, M.G., Naor, J., Orda, A.: Tight bounds for dynamic storage allocation. SIAM Journal on Discrete Math.\u00a09, 155\u2013166 (1996)","journal-title":"SIAM Journal on Discrete Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(99)00175-4","volume":"3","author":"J. Naor","year":"2000","unstructured":"Naor, J., Orda, A., Petruschka, Y.: Dynamic storage allocation with known durations. Discrete Applied Mathematics\u00a03, 203\u2013213 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR5","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing Company, Boston (1996)"},{"key":"3_CR6","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 3rd edn., vol.\u00a03. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(92)90034-D","volume":"97","author":"D.E. Willard","year":"1992","unstructured":"Willard, D.E.: A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation\u00a097, 150\u2013204 (1992)","journal-title":"Information and Computation"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539701389956","volume":"35","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. SIAM J. Comput.\u00a035, 341\u2013358 (2005)","journal-title":"SIAM J. Comput."},{"key":"#cr-split#-3_CR9.1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Hu, H.: An adaptive packed-memory array. Transactions on Database Systems??32 (2007);","DOI":"10.1145\/1292609.1292616"},{"key":"#cr-split#-3_CR9.2","unstructured":"Special Issue on PODS 2006"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00224-005-1237-z","volume":"39","author":"M.A. Bender","year":"2006","unstructured":"Bender, M.A., Farach-Colton, M., Mosteiro, M.A.: Insertion sort is O(n log n). Theory of Computing Systems\u00a039, 391\u2013397 (2006); Special Issue on FUN 2004","journal-title":"Theory of Computing Systems"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gue, K.R., Kim, B.S.: Puzzle-based storage systems. TR, Auburn University (2006)","DOI":"10.21236\/ADA466830"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: Approximate strip packing. In: Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., pp. 31\u201336 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Augustine, J., Banerjee, S., Irani, S.: Strip packing with precedence constraints and strip packing with release times. In: Proc. 18th Annu. ACM Sympos. Parallel Algor. Architect., pp. 180\u2013189 (2006)","DOI":"10.1145\/1148109.1148139"},{"key":"3_CR14","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), Atlanta, Georgia, pp. 52\u201358 (1996)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:15:55Z","timestamp":1558523755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}