{"id":"https://openalex.org/W2296610080","doi":"https://doi.org/10.29007/zm9s","title":"On Implementing Modular Complexity Analysis","display_name":"On Implementing Modular Complexity Analysis","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2296610080","doi":"https://doi.org/10.29007/zm9s","mag":"2296610080"},"language":"en","primary_location":{"id":"doi:10.29007/zm9s","is_oa":true,"landing_page_url":"https://doi.org/10.29007/zm9s","pdf_url":"https://easychair.org/publications/open/1Pwb","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/1Pwb","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028009961","display_name":"Harald Zankl","orcid":null},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Harald Zankl","raw_affiliation_strings":["Institute of Computer Science, University of Innsbruck, 6020 Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, 6020 Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028162372","display_name":"Martin Korp","orcid":null},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Martin Korp","raw_affiliation_strings":["Institute of Computer Science, University of Innsbruck, 6020 Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, 6020 Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028009961"],"corresponding_institution_ids":["https://openalex.org/I190249584"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00446805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"42","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8165493011474609},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.7218648195266724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6732451915740967},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5936619639396667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5568540692329407},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5447831749916077},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45538073778152466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3642396628856659},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3143898546695709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3063020706176758}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8165493011474609},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.7218648195266724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6732451915740967},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5936619639396667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5568540692329407},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5447831749916077},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45538073778152466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3642396628856659},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3143898546695709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3063020706176758},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.29007/zm9s","is_oa":true,"landing_page_url":"https://doi.org/10.29007/zm9s","pdf_url":"https://easychair.org/publications/open/1Pwb","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.417.8093","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.8093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easychair.org/publications/?page=1715357962","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.639.8794","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.8794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easychair.org/publications/?page=1715357962","raw_type":"text"}],"best_oa_location":{"id":"doi:10.29007/zm9s","is_oa":true,"landing_page_url":"https://doi.org/10.29007/zm9s","pdf_url":"https://easychair.org/publications/open/1Pwb","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2887203982","display_name":null,"funder_award_id":"P22467","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2296610080.pdf","grobid_xml":"https://content.openalex.org/works/W2296610080.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W113842403","https://openalex.org/W1517466677","https://openalex.org/W1568532679","https://openalex.org/W1583295953","https://openalex.org/W1833403382","https://openalex.org/W1896024941","https://openalex.org/W2037664852","https://openalex.org/W2111433946","https://openalex.org/W2169568716","https://openalex.org/W4230919050"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"We":[0],"recall":[1],"the":[2,15,62,65],"recent":[3],"approach":[4,30,63],"by":[5,52],"(Zankl":[6],"and":[7],"Korp,":[8],"2010)":[9],"to":[10,33,44],"prove":[11],"upper":[12],"bounds":[13,35],"on":[14],"(derivational)":[16],"complexity":[17],"of":[18,61],"term":[19],"rewrite":[20],"systems":[21],"modularly.":[22],"In":[23],"this":[24,29],"note":[25],"we":[26],"show":[27],"that":[28,55],"is":[31,43],"suitable":[32],"tighten":[34],"after":[36],"they":[37],"have":[38],"been":[39],"established.":[40],"The":[41],"idea":[42],"replace":[45],"proof":[46],"steps":[47],"with":[48],"a":[49],"large":[50],"bound":[51],"(new)":[53],"proofs":[54],"yield":[56],"smaller":[57],"bounds.":[58],"An":[59],"evaluation":[60],"shows":[64],"benefits.":[66]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}