{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:54Z","timestamp":1772163954571,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,15]]},"DOI":"10.1145\/1065910.1065942","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"222-229","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Upper bound for defragmenting buddy heaps"],"prefix":"10.1145","author":[{"given":"Delvin C.","family":"Defoe","sequence":"first","affiliation":[{"name":"Washington University, Saint Louis, MO"}]},{"given":"Sharath R.","family":"Cholleti","sequence":"additional","affiliation":[{"name":"Washington University, Saint Louis, MO"}]},{"given":"Ron K.","family":"Cytron","sequence":"additional","affiliation":[{"name":"Washington University, Saint Louis, MO"}]}],"member":"320","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349334"},{"key":"e_1_3_2_1_2_1","volume-title":"Washington University","author":"Cholleti Sharath Reddy","year":"2002"},{"key":"e_1_3_2_1_3_1","volume-title":"SPEC","author":"SPEC Corporation","year":"1999"},{"key":"e_1_3_2_1_4_1","volume-title":"Washington University in St. Louis, 2003","author":"Defoe Delvin C.","year":"2003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646787.703877"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/286860.286864"},{"key":"e_1_3_2_1_7_1","volume-title":"Fundamental Algorithms","author":"Knuth Donald E.","year":"1973"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321846"},{"key":"e_1_3_2_1_9_1","unstructured":"Paul R. Wilson. Uniprocessor Garbage Collection Techniques (Long Version). Submitted to ACM Computing Surveys 1994.  Paul R. Wilson. Uniprocessor Garbage Collection Techniques (Long Version). Submitted to ACM Computing Surveys 1994."}],"event":{"name":"LCTES05: Languages, Compilers, and Tools for Embedded Systems 2005","location":"Chicago Illinois USA","acronym":"LCTES05","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 2005 ACM SIGPLAN\/SIGBED conference on Languages, compilers, and tools for embedded systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1065910.1065942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T08:41:26Z","timestamp":1693816886000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1065910.1065942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,15]]},"references-count":9,"alternative-id":["10.1145\/1065910.1065942","10.1145\/1065910"],"URL":"https:\/\/doi.org\/10.1145\/1065910.1065942","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1070891.1065942","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,6,15]]},"assertion":[{"value":"2005-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}