{"id":"https://openalex.org/W1500866162","doi":"https://doi.org/10.4086/toc.2015.v011a019","title":"","display_name":"","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1500866162","doi":"https://doi.org/10.4086/toc.2015.v011a019","mag":"1500866162"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2015.v011a019","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a019","pdf_url":"http://www.theoryofcomputing.org/articles/v011a019/v011a019.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v011a019/v011a019.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079684179","display_name":"Joshua Brody","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Joshua Brody","raw_affiliation_strings":["Center of the Danish National Research Foundation","Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of the Danish National Research Foundation","institution_ids":["https://openalex.org/I4210087405"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013551063","display_name":"Kasper Green Larsen","orcid":"https://orcid.org/0000-0001-8841-5929"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kasper Green Larsen","raw_affiliation_strings":["Aarhus University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1626,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.92696796,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":"1","first_page":"471","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/polynomial","display_name":"Polynomial","score":0.5711878538131714},{"id":"https://openalex.org/keywords/die","display_name":"Die (integrated circuit)","score":0.49724677205085754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4700046181678772},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4564720094203949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41399139165878296},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40801575779914856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3532198965549469}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5711878538131714},{"id":"https://openalex.org/C111106434","wikidata":"https://www.wikidata.org/wiki/Q1072430","display_name":"Die (integrated circuit)","level":2,"score":0.49724677205085754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4700046181678772},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4564720094203949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41399139165878296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40801575779914856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3532198965549469},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.4086/toc.2015.v011a019","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a019","pdf_url":"http://www.theoryofcomputing.org/articles/v011a019/v011a019.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1208.2846","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1208.2846","pdf_url":"https://arxiv.org/pdf/1208.2846","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:works.swarthmore.edu:fac-comp-sci-1105","is_oa":true,"landing_page_url":"https://works.swarthmore.edu/fac-comp-sci/106","pdf_url":"https://works.swarthmore.edu/fac-comp-sci/106","source":{"id":"https://openalex.org/S4377196506","display_name":"Works - Scholarship, Research, & Creative Expression (Swarthmore College)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118020396","host_organization_name":"Swarthmore College","host_organization_lineage":["https://openalex.org/I118020396"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Works","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.461","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.swarthmore.edu/%7Ebrody/papers/adapt-or-die.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.753.5516","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.753.5516","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1208.2846.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire/a1ff4636-066f-4e54-ae4c-9fee7ee27e88","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/a1ff4636-066f-4e54-ae4c-9fee7ee27e88","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brody, J E & Larsen, K G 2015, 'Adapt or Die : Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures', Theory of Computing, vol. 11, no. 19, pp. 471-489. https://doi.org/10.4086/toc.2015.v011a019","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.4086/toc.2015.v011a019","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a019","pdf_url":"http://www.theoryofcomputing.org/articles/v011a019/v011a019.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1500866162.pdf","grobid_xml":"https://content.openalex.org/works/W1500866162.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W4211966","https://openalex.org/W88251305","https://openalex.org/W1530008367","https://openalex.org/W1557856049","https://openalex.org/W1963524245","https://openalex.org/W1975859913","https://openalex.org/W1976149033","https://openalex.org/W1980223785","https://openalex.org/W1982776217","https://openalex.org/W1984079283","https://openalex.org/W1984184793","https://openalex.org/W1988508518","https://openalex.org/W1989664320","https://openalex.org/W1993022201","https://openalex.org/W1993188092","https://openalex.org/W1995875735","https://openalex.org/W2002501531","https://openalex.org/W2051810819","https://openalex.org/W2063284471","https://openalex.org/W2070486524","https://openalex.org/W2078939351","https://openalex.org/W2080995342","https://openalex.org/W2087040128","https://openalex.org/W2089620427","https://openalex.org/W2098207812","https://openalex.org/W2101403145","https://openalex.org/W2107917944","https://openalex.org/W2120210041","https://openalex.org/W2127125853","https://openalex.org/W2129120879","https://openalex.org/W2162446681","https://openalex.org/W2165461157","https://openalex.org/W3140526873","https://openalex.org/W4252217479","https://openalex.org/W4253760044","https://openalex.org/W4399855220"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4404521051","https://openalex.org/W2042913821","https://openalex.org/W2051487156","https://openalex.org/W2738154096","https://openalex.org/W2372289614","https://openalex.org/W2629813803","https://openalex.org/W2041067810","https://openalex.org/W2250518232","https://openalex.org/W3199170188"],"abstract_inverted_index":{"In":[0],"this":[1,93],"paper,":[2],"we":[3],"study":[4,52],"the":[5,22,38,45,58,69,88,100],"role":[6],"non-adaptivity":[7],"plays":[8],"in":[9,57,76,87,125],"maintaining":[10],"dynamic":[11],"data":[12,17,55,84,107,135],"structures.":[13,136],"Roughly":[14],"speaking,":[15],"a":[16,31,97],"structure":[18,108],"is":[19,66,110,119],"non-adaptive":[20,54,134],"if":[21],"memory":[23],"locations":[24],"it":[25],"reads":[26],"and/or":[27],"writes":[28],"when":[29],"processing":[30],"query":[32,39],"or":[33,40],"update":[34,41],"depend":[35],"only":[36,111],"on":[37,44],"and":[42,75],"not":[43],"contents":[46],"of":[47,68],"previously":[48],"read":[49],"cells.":[50],"We":[51],"such":[53],"structures":[56,85],"cell":[59,63,78,129],"probe":[60,64,79,130],"model.":[61,91],"The":[62],"model":[65],"one":[67,123],"least":[70],"restrictive":[71],"lower":[72,80,102,131],"bound":[73,103],"models":[74],"particular,":[77],"bounds":[81,132],"apply":[82],"to":[83,120],"developed":[86],"popular":[89],"word-RAM":[90],"Unfortunately,":[92],"generality":[94],"comes":[95],"at":[96],"high":[98],"cost:":[99],"highest":[101],"proved":[104],"for":[105,133],"any":[106],"problem":[109],"polylogarithmic":[112],"(if":[113],"allowed":[114],"adaptivity).":[115],"Our":[116],"main":[117],"result":[118],"demonstrate":[121],"that":[122],"can":[124],"fact":[126],"obtain":[127],"polynomial":[128]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}
