{"id":"https://openalex.org/W2078423836","doi":"https://doi.org/10.1016/0304-3975(94)90159-7","title":"Complexity models for incremental computation","display_name":"Complexity models for incremental computation","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W2078423836","doi":"https://doi.org/10.1016/0304-3975(94)90159-7","mag":"2078423836"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)90159-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90159-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5006968747","display_name":"Peter Bro Miltersen","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"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":["Computer Science Department, DAIMI, Aarhus University, Ny Munkegade, Bldng. 540, DK-8000 Aarhus C, Denmark"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, DAIMI, Aarhus University, Ny Munkegade, Bldng. 540, DK-8000 Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054397956","display_name":"Sairam Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sairam Subramanian","raw_affiliation_strings":["Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI 02912-1910, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI 02912-1910, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Department of Computer Science, Duke University, P.O. Box 90129, Durham, NC 27708-0129, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, P.O. Box 90129, Durham, NC 27708-0129, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079716343","display_name":"Roberto Tamassia","orcid":"https://orcid.org/0000-0003-2445-6064"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roberto Tamassia","raw_affiliation_strings":["Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI 02912-1910, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI 02912-1910, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006968747"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":8.8082,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.98585879,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"130","issue":"1","first_page":"203","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/completeness","display_name":"Completeness (order theory)","score":0.6373817920684814},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6299436092376709},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5942673087120056},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5902907848358154},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5863949060440063},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5861032605171204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566121339797974},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5202680826187134},{"id":"https://openalex.org/keywords/comparator","display_name":"Comparator","score":0.4925594925880432},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43543845415115356},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.4335605502128601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4240001440048218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4089577794075012},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07220342755317688}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6373817920684814},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6299436092376709},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5942673087120056},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5902907848358154},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5863949060440063},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5861032605171204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566121339797974},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5202680826187134},{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.4925594925880432},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43543845415115356},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.4335605502128601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4240001440048218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4089577794075012},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07220342755317688},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0304-3975(94)90159-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90159-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.3418","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.au.dk/~bromille/Papers/./cmic.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.9397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.9397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.duke.edu/pub/dist/techreport/1994/1994-13.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.7915","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.7915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~jsv/Papers/MSV93.inc-complexity.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/54a79330-b1cb-11df-8c1a-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/54a79330-b1cb-11df-8c1a-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Miltersen, P B, Subramanian, S, Vitter, J S & Tamassia, R 1994, 'Complexity models for incremental computation', Theoretical Computer Science, vol. 130, no. 1, pp. 203-236. https://doi.org/10.1016/0304-3975(94)90159-7","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/5","score":0.5799999833106995,"display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W205976932","https://openalex.org/W1512709563","https://openalex.org/W1575886793","https://openalex.org/W1580580301","https://openalex.org/W1985203234","https://openalex.org/W1985623817","https://openalex.org/W1990870868","https://openalex.org/W2018804864","https://openalex.org/W2021615496","https://openalex.org/W2023930099","https://openalex.org/W2033701176","https://openalex.org/W2041883181","https://openalex.org/W2068330457","https://openalex.org/W2083394054","https://openalex.org/W2088956149","https://openalex.org/W2089620427","https://openalex.org/W2089857781","https://openalex.org/W2104952158","https://openalex.org/W2116100695","https://openalex.org/W2132750992","https://openalex.org/W2151464934","https://openalex.org/W2173502887","https://openalex.org/W2260998758","https://openalex.org/W2911412206","https://openalex.org/W6608375579","https://openalex.org/W6630635006","https://openalex.org/W6634287997","https://openalex.org/W6634602310","https://openalex.org/W6656016226","https://openalex.org/W6659087700","https://openalex.org/W6672841737","https://openalex.org/W6692623802","https://openalex.org/W6759033368"],"related_works":["https://openalex.org/W2970311880","https://openalex.org/W2085484366","https://openalex.org/W4388215614","https://openalex.org/W1501278571","https://openalex.org/W2095274905","https://openalex.org/W2956865288","https://openalex.org/W4288283913","https://openalex.org/W4205899062","https://openalex.org/W1501038385","https://openalex.org/W1722394934"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}