{"id":"https://openalex.org/W2008600685","doi":"https://doi.org/10.1145/52964.52983","title":"Program complexity: a tutorial","display_name":"Program complexity: a tutorial","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2008600685","doi":"https://doi.org/10.1145/52964.52983","mag":"2008600685"},"language":"en","primary_location":{"id":"doi:10.1145/52964.52983","doi":"https://doi.org/10.1145/52964.52983","is_oa":true,"landing_page_url":"https://doi.org/10.1145/52964.52983","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/52965.52983","source":{"id":"https://openalex.org/S4363608709","display_name":"ACM Technical Symposium on Computer Science Education (SIGCSE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth SIGCSE technical symposium on Computer science education - SIGCSE '88","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/52965.52983","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022798395","display_name":"David Finkel","orcid":"https://orcid.org/0000-0002-0548-7781","observed_orcids":["https://orcid.org/0000-0002-0548-7781"]},"institutions":[{"id":"https://openalex.org/I131221577","display_name":"Bucknell University","ror":"https://ror.org/00fc1qt65","country_code":"US","type":"education","lineage":["https://openalex.org/I131221577"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Finkel","raw_affiliation_strings":["Bucknell Univ., Lewisburg, PA","Bucknell University, Lewisburg PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bucknell Univ., Lewisburg, PA","institution_ids":["https://openalex.org/I131221577"]},{"raw_affiliation_string":"Bucknell University, Lewisburg PA","institution_ids":["https://openalex.org/I131221577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026736818","display_name":"Gary Haggard","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I131221577","display_name":"Bucknell University","ror":"https://ror.org/00fc1qt65","country_code":"US","type":"education","lineage":["https://openalex.org/I131221577"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary Haggard","raw_affiliation_strings":["Bucknell Univ., Lewisburg, PA","Bucknell University, Lewisburg PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bucknell Univ., Lewisburg, PA","institution_ids":["https://openalex.org/I131221577"]},{"raw_affiliation_string":"Bucknell University, Lewisburg PA","institution_ids":["https://openalex.org/I131221577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I131221577"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"77"},"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.614300012588501,"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.614300012588501,"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/T11269","display_name":"Algorithms and Data Compression","score":0.2433999925851822,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.0414000004529953,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/software-complexity","display_name":"software complexity","score":0.9700000286102295},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.609000027179718},{"id":"https://openalex.org/keywords/asymptotic-analysis","display_name":"asymptotic analysis","score":0.7689999938011169},{"id":"https://openalex.org/keywords/big-o-notation","display_name":"big O notation","score":0.609000027179718},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.48100000619888306},{"id":"https://openalex.org/keywords/algorithm-selection","display_name":"algorithm selection","score":0.4880000054836273},{"id":"https://openalex.org/keywords/mathematical-functions","display_name":"mathematical functions","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6894307732582092},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3936731815338135},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.3450242578983307}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/52964.52983","doi":"https://doi.org/10.1145/52964.52983","is_oa":true,"landing_page_url":"https://doi.org/10.1145/52964.52983","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/52965.52983","source":{"id":"https://openalex.org/S4363608709","display_name":"ACM Technical Symposium on Computer Science Education (SIGCSE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth SIGCSE technical symposium on Computer science education - SIGCSE '88","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/52964.52983","doi":"https://doi.org/10.1145/52964.52983","is_oa":true,"landing_page_url":"https://doi.org/10.1145/52964.52983","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/52965.52983","source":{"id":"https://openalex.org/S4363608709","display_name":"ACM Technical Symposium on Computer Science Education (SIGCSE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth SIGCSE technical symposium on Computer science education - SIGCSE '88","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2008600685.pdf","grobid_xml":"https://content.openalex.org/works/W2008600685.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6884945666","https://openalex.org/W3159651609","https://openalex.org/W127169828","https://openalex.org/W2305010175","https://openalex.org/W2501093437","https://openalex.org/W2222100699","https://openalex.org/W6921654828","https://openalex.org/W4254280064","https://openalex.org/W7007913068","https://openalex.org/W4205297765"],"abstract_inverted_index":{"How":[0],"does":[1],"a":[2,14,18,33,44,69,88],"programmer":[3,60],"decide":[4],"which":[5],"of":[6,29,32,39,47,55,72,87,105,116],"two":[7,118],"different":[8],"algorithms":[9,126,141],"to":[10,12,61,83,139],"use":[11],"solve":[13],"problem?":[15],"This":[16,74],"is":[17],"particularly":[19],"difficult":[20],"question":[21],"because":[22],"one":[23,27,77],"finds":[24],"that":[25,96,146],"often":[26],"part":[28,54],"the":[30,36,40,48,56,59,85,103,114,144],"solution":[31,57,67,104],"problem":[34,107],"\u201cdominates\u201d":[35],"running":[37],"time":[38,131],"solution,":[41],"i.e.":[42],"uses":[43],"large":[45,70],"fraction":[46],"execution":[49,99,130],"time.":[50,100],"Further,":[51],"this":[52,106],"special":[53],"requires":[58],"choose":[62],"an":[63],"algorithm":[64],"for":[65],"its":[66],"from":[68],"number":[71],"alternatives.":[73],"tutorial":[75],"describes":[76],"approach":[78],"used":[79],"in":[80],"computer":[81],"science":[82],"measure":[84],"complexity":[86],"program":[89],"by":[90,133,142],"modeling":[91],"programs":[92],"with":[93],"mathematical":[94],"functions":[95,119,145],"describe":[97,147],"their":[98,129],"We":[101,111,122],"break":[102],"into":[108],"three":[109],"parts.":[110],"first":[112],"discuss":[113],"notion":[115],"how":[117,125,138],"are":[120],"compared.":[121],"then":[123],"show":[124],"can":[127],"have":[128],"modeled":[132],"functions.":[134],"Finally,":[135],"we":[136],"see":[137],"compare":[140],"comparing":[143],"them.":[148]},"counts_by_year":[],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}