{"id":"https://openalex.org/W1977753569","doi":"https://doi.org/10.1137/0213037","title":"Insertion and Compaction Algorithms in Sequentially Allocated Storage","display_name":"Insertion and Compaction Algorithms in Sequentially Allocated Storage","publication_year":1984,"publication_date":"1984-08-01","ids":{"openalex":"https://openalex.org/W1977753569","doi":"https://doi.org/10.1137/0213037","mag":"1977753569"},"language":"en","primary_location":{"id":"doi:10.1137/0213037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213037","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108392571","display_name":"Brenda S. Baker","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. S. Baker","raw_affiliation_strings":["Bell Laboratories Murray Hill NJ"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034122892","display_name":"E. G. Coffman","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. G. Coffman, Jr.","raw_affiliation_strings":["Bell Laboratories Murray Hill NJ"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108392571"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":1.1954,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78946364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"3","first_page":"600","last_page":"609"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6421667337417603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5785409212112427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.508143424987793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4838103652000427},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47791796922683716},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4752490222454071},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43994471430778503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38661983609199524},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3390580415725708}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6421667337417603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5785409212112427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.508143424987793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4838103652000427},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47791796922683716},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4752490222454071},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43994471430778503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38661983609199524},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3390580415725708}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213037","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1996027765","https://openalex.org/W2011039300","https://openalex.org/W2094678784","https://openalex.org/W2127527141","https://openalex.org/W4238798236"],"related_works":["https://openalex.org/W2029210135","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645"],"abstract_inverted_index":{"Among":[0],"the":[1,18,79,121,151,156],"more":[2],"difficult":[3],"combinatorial":[4],"problems":[5],"in":[6,12,86,158],"computer":[7],"science":[8],"are":[9,89],"those":[10],"occurring":[11,23],"dynamic":[13],"storage":[14,31],"allocation.":[15],"We":[16,98,118],"investigate":[17],"handling":[19],"of":[20,30,38,47,65,71,96,108,110,123,154,167],"memory":[21,66,116],"conflicts":[22],"when":[24],"a":[25,28,61,72,100,129,165],"request":[26],"for":[27,90,104,113],"block":[29,51],"is":[32,41,57,133,171],"received,":[33],"but":[34],"no":[35,134],"one":[36,92,127,159],"region":[37],"available":[39],"space":[40],"large":[42],"enough":[43],"due":[44],"to":[45,59],"fragmentation":[46],"storage.":[48],"For":[49,163],"arbitrary":[50],"sizes,":[52],"we":[53,76],"show":[54,119],"that":[55,67,120],"it":[56],"NP-hard":[58],"find":[60],"minimal":[62,105,114,152],"cost":[63,106,115,122,153],"reallocation":[64],"will":[68],"allow":[69],"insertion":[70],"new":[73],"block.":[74],"Therefore,":[75],"focus":[77],"on":[78],"\u201cbay":[80],"restaurant\u201d":[81],"model":[82],"studied":[83],"by":[84],"Robson,":[85],"which":[87],"requests":[88],"only":[91],"or":[93],"two":[94],"units":[95],"memory.":[97],"give":[99],"polynomial":[101],"time":[102],"algorithm":[103],"insertions":[107],"batches":[109],"blocks":[111,126,157],"and":[112],"compaction.":[117],"inserting":[124,155],"p":[125,143,164],"at":[128],"time,":[130],"i.e.":[131,161],"on-line,":[132],"worse":[135],"than":[136],"\\[":[137],"\\left\\lfloor":[138],"2\\left(":[139],"\\frac{3}{2}":[140],"\\right)^{\\lceil":[141],"\\log":[142],"\\rceil":[144],"}":[145],"-":[146],"1":[147],"\\right\\rfloor":[148],"\\]":[149],"times":[150],"batch,":[160],"off-line.":[162],"power":[166],"two,":[168],"this":[169],"bound":[170],"tight.":[172]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}