{"id":"https://openalex.org/W2107588378","doi":"https://doi.org/10.1145/1287624.1287681","title":"Measuring empirical computational complexity","display_name":"Measuring empirical computational complexity","publication_year":2007,"publication_date":"2007-09-07","ids":{"openalex":"https://openalex.org/W2107588378","doi":"https://doi.org/10.1145/1287624.1287681","mag":"2107588378"},"language":"en","primary_location":{"id":"doi:10.1145/1287624.1287681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287624.1287681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt6v04j2kh/qt6v04j2kh.pdf?t=mtfek2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086118320","display_name":"Simon F. Goldsmith","orcid":null},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Simon F. Goldsmith","raw_affiliation_strings":["UC Berkeley, Berkeley, CA","UC Berkeley, Berkeley, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]},{"raw_affiliation_string":"UC Berkeley, Berkeley, CA#TAB#","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex S. Aiken","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054337387","display_name":"Daniel Shawcross Wilkerson","orcid":null},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel S. Wilkerson","raw_affiliation_strings":["Berkeley, CA"],"affiliations":[{"raw_affiliation_string":"Berkeley, CA","institution_ids":["https://openalex.org/I134446601"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086118320"],"corresponding_institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":7.4051,"has_fulltext":true,"cited_by_count":153,"citation_normalized_percentile":{"value":0.97310215,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9993000030517578,"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/T12127","display_name":"Software System Performance and Reliability","score":0.9993000030517578,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.8017023205757141},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.7383874654769897},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6289463639259338},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5902056694030762},{"id":"https://openalex.org/keywords/programming-complexity","display_name":"Programming complexity","score":0.5017681121826172},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4656914472579956},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.45538073778152466},{"id":"https://openalex.org/keywords/asymptotic-computational-complexity","display_name":"Asymptotic computational complexity","score":0.44904154539108276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4203437566757202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33544695377349854},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.2598232626914978},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17944374680519104},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13398882746696472},{"id":"https://openalex.org/keywords/software-development","display_name":"Software development","score":0.12456148862838745},{"id":"https://openalex.org/keywords/computational-resource","display_name":"Computational resource","score":0.10679951310157776}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8017023205757141},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.7383874654769897},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6289463639259338},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5902056694030762},{"id":"https://openalex.org/C66429209","wikidata":"https://www.wikidata.org/wiki/Q7248499","display_name":"Programming complexity","level":5,"score":0.5017681121826172},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4656914472579956},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.45538073778152466},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.44904154539108276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4203437566757202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33544695377349854},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.2598232626914978},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17944374680519104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13398882746696472},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.12456148862838745},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.10679951310157776},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C186846655","wikidata":"https://www.wikidata.org/wiki/Q3398377","display_name":"Software construction","level":4,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/1287624.1287681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287624.1287681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering","raw_type":"proceedings-article"},{"id":"pmh:qt6v04j2kh","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/6v04j2kh","pdf_url":"https://escholarship.org/content/qt6v04j2kh/qt6v04j2kh.pdf?t=mtfek2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goldsmith, Simon. (2008). Measuring Empirical Computational Complexity. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/6v04j2kh","raw_type":"dissertation"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.2610","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~aiken/publications/theses/goldsmith.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.1297","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.1297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-52.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.6883","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.6883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.cs.berkeley.edu/%7Esfg/berkeley/sfvg-phd.pdf","raw_type":"text"},{"id":"pmh:oai:berkeley.edu:28722-bk0004d845s","is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/EECS-2009-52.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt6v04j2kh","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/6v04j2kh","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"}],"best_oa_location":{"id":"pmh:qt6v04j2kh","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/6v04j2kh","pdf_url":"https://escholarship.org/content/qt6v04j2kh/qt6v04j2kh.pdf?t=mtfek2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goldsmith, Simon. (2008). Measuring Empirical Computational Complexity. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/6v04j2kh","raw_type":"dissertation"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2107588378.pdf","grobid_xml":"https://content.openalex.org/works/W2107588378.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1491178396","https://openalex.org/W1492171827","https://openalex.org/W1509382141","https://openalex.org/W1509562192","https://openalex.org/W1555637434","https://openalex.org/W1588126207","https://openalex.org/W1670999730","https://openalex.org/W1850911596","https://openalex.org/W1969947998","https://openalex.org/W2001914359","https://openalex.org/W2002148379","https://openalex.org/W2003295303","https://openalex.org/W2020804487","https://openalex.org/W2031487553","https://openalex.org/W2042120213","https://openalex.org/W2047281039","https://openalex.org/W2051600983","https://openalex.org/W2060213695","https://openalex.org/W2065413511","https://openalex.org/W2072047588","https://openalex.org/W2109863363","https://openalex.org/W2119095262","https://openalex.org/W2120176508","https://openalex.org/W2125313776","https://openalex.org/W2132219981","https://openalex.org/W2144433126","https://openalex.org/W2149237601","https://openalex.org/W2155751343","https://openalex.org/W2161938901","https://openalex.org/W2164284791","https://openalex.org/W2519486160","https://openalex.org/W2541360572","https://openalex.org/W2752885492","https://openalex.org/W2914109978"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W1548964214","https://openalex.org/W1512399864","https://openalex.org/W2047754121","https://openalex.org/W1974040526","https://openalex.org/W2801167165","https://openalex.org/W2229588459","https://openalex.org/W1964595892","https://openalex.org/W2327776271","https://openalex.org/W2353365661"],"abstract_inverted_index":{"The":[0],"standard":[1],"language":[2],"for":[3,18,114],"describing":[4,19],"the":[5,20,71,110,152],"asymptotic":[6,21,77],"behavior":[7,22],"of":[8,23,44,64,117,148,151],"algorithms":[9],"is":[10],"theoretical":[11,76,174],"computational":[12,31,119],"complexity.":[13,32],"We":[14,106,155],"propose":[15],"a":[16,37,56,62,86,130,134,138,142,166,179],"method":[17,34],"programs":[24,161],"in":[25,46,129],"practice":[26],"by":[27],"measuring":[28,48],"their":[29,49],"empirical":[30,118],"Our":[33],"involves":[35],"running":[36],"program":[38,95,131,167],"on":[39,98,103,158],"workloads":[40],"spanning":[41],"several":[42,159],"orders":[43],"magnitude":[45],"size,":[47],"performance,":[50],"and":[51,93,162],"fitting":[52],"these":[53,68,99],"observations":[54],"to":[55,70,75],"model":[57],"that":[58,85,121],"predicts":[59],"performance":[60,81,88,180],"as":[61,90,133,169],"function":[63,147],"workload":[65],"size.":[66],"Comparing":[67],"models":[69,100,116],"programmer's":[72],"expectations":[73],"or":[74,83,141,177],"bounds":[78],"can":[79],"reveal":[80],"bugs":[82],"confirm":[84],"program's":[87,153],"scales":[89],"expected.":[91],"Grouping":[92],"ranking":[94],"locations":[96],"based":[97],"focuses":[101],"attention":[102],"scalability-critical":[104],"code.":[105],"describe":[107],"our":[108],"tool,":[109],"Trend":[111],"Profiler":[112],"(trend-prof),":[113],"constructing":[115],"complexity":[120,175],"predict":[122],"how":[123],"many":[124],"times":[125],"each":[126],"basic":[127],"block":[128],"runs":[132],"linear":[135],"(y":[136,144],"=":[137,145],"+":[139],"bx)":[140],"powerlaw":[143],"axb)":[146],"user-specified":[149],"features":[150],"workloads.":[154],"ran":[156],"trend-prof":[157],"large":[160],"report":[163],"cases":[164],"where":[165],"scaled":[168],"expected,":[170],"beat":[171],"its":[172],"worst-case":[173],"bound,":[176],"had":[178],"bug.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}