{"id":"https://openalex.org/W120371813","doi":"https://doi.org/10.1137/0204024","title":"Managing Storage for Extendible Arrays","display_name":"Managing Storage for Extendible Arrays","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W120371813","doi":"https://doi.org/10.1137/0204024","mag":"120371813"},"language":"en","primary_location":{"id":"doi:10.1137/0204024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204024","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/A5032954059","display_name":"Arnold L. Rosenberg","orcid":"https://orcid.org/0000-0002-1171-9323"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arnold L. Rosenberg","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032954059"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7111,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.9041417,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3","first_page":"287","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9907000064849854,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.7507569789886475},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7319741249084473},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6795989274978638},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5959804058074951},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.521238386631012},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.48312827944755554},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.48078006505966187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46968749165534973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4191092252731323},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37190911173820496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3682417571544647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3563537001609802},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.303101122379303},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06797224283218384},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06117996573448181}],"concepts":[{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.7507569789886475},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7319741249084473},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6795989274978638},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5959804058074951},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.521238386631012},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.48312827944755554},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.48078006505966187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46968749165534973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4191092252731323},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37190911173820496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3682417571544647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3563537001609802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.303101122379303},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06797224283218384},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06117996573448181},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0204024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204024","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"},{"id":"mag:120371813","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stoc/stoc74.html#Rosenberg74","pdf_url":null,"source":{"id":"https://openalex.org/S4306421003","display_name":"Symposium on the Theory of Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on the Theory of Computing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2044167269"],"related_works":["https://openalex.org/W1547236215","https://openalex.org/W2781321503","https://openalex.org/W1573460212","https://openalex.org/W2003281721","https://openalex.org/W2728496244","https://openalex.org/W2076208233","https://openalex.org/W272126364","https://openalex.org/W2109417946","https://openalex.org/W1556880781","https://openalex.org/W2017158455","https://openalex.org/W3090340141","https://openalex.org/W2152515015","https://openalex.org/W2339449353","https://openalex.org/W2387624607","https://openalex.org/W3105362324","https://openalex.org/W2141057167","https://openalex.org/W35875708","https://openalex.org/W2912018331","https://openalex.org/W2118757154","https://openalex.org/W198137895"],"abstract_inverted_index":{"Schemes":[0],"which":[1,74,153,162,183],"allocate":[2],"storage":[3,9,35,106,156],"for":[4,66,98,196],"extendible":[5,38,71,91,151],"arrays":[6,124,134,161,182],"cannot":[7],"utilize":[8,155],"as":[10,12],"efficiently":[11,158],"can":[13,86,125,149],"their":[14],"nonextendible":[15],"counterparts.":[16],"Relative":[17],"to":[18,89,128,137,140,164],"formal":[19,29],"notions":[20],"of":[21,31,34,46,121,123,145,199],"array":[22,26,39,58,92],"scheme":[23,73],"and":[24,60,69,167],"(extendible)":[25],"realization,":[27],"a":[28,43],"way":[30],"gauging":[32],"efficiency":[33,108],"utilization":[36,107],"by":[37],"realizations":[40,99,152],"is":[41,56,64,79,95,109,188,194],"proposed;":[42],"lower":[44,77,103,131,172],"bound":[45,78,104,173],"$O(p":[47],"\\cdot":[48,175],"(\\log":[49,176],"p)^{d":[50,177],"-":[51,178],"1}":[52,179],")$,":[53],"where":[54],"p":[55],"the":[57,62,102,113,119,130,165,170],"size":[59],"d":[61],"dimensionality,":[63],"derived":[65],"this":[67,76,192],"measure;":[68],"an":[70],"allocation":[72],"achieves":[75],"exhibited.":[80],"Certain":[81],"seminorms":[82],"on":[83,105,118,160,181],"Euclidean":[84],"spaces":[85],"be":[87,126],"used":[88,127],"construct":[90],"realizations.":[93],"It":[94,187],"shown":[96],"that":[97],"so":[100],"constructed,":[101],"$O(p^d":[110],")$.":[111],"In":[112],"opposite":[114],"direction,":[115],"certain":[116],"restrictions":[117],"patterns":[120,166],"expansions":[122],"circumvent":[129],"bound:":[132],"When":[133],"are":[135],"constrained":[136],"expand":[138],"according":[139],"some":[141],"fixed":[142],"finite":[143],"set":[144],"patterns,":[146],"then":[147],"one":[148],"devise":[150],"(a)":[154],"very":[157],"$(O(p))$":[159],"conform":[163],"(b)":[168],"approach":[169],"general":[171],"$(O(p":[174],"))$":[180],"do":[184],"not":[185,189],"conform.":[186],"known":[190],"if":[191],"improvement":[193],"available":[195],"infinite":[197],"sets":[198],"patterns.":[200]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}