{"id":"https://openalex.org/W2258276823","doi":"https://doi.org/10.1145/2837614.2837646","title":"The complexity of interaction","display_name":"The complexity of interaction","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2258276823","doi":"https://doi.org/10.1145/2837614.2837646","mag":"2258276823"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837646","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2837646&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2837646&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036508584","display_name":"St\u00e9phane Gimenez","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":"St\u00e9phane Gimenez","raw_affiliation_strings":["University of Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050172197","display_name":"Georg Moser","orcid":"https://orcid.org/0000-0001-9240-6128"},"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":"Georg Moser","raw_affiliation_strings":["University of Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036508584"],"corresponding_institution_ids":["https://openalex.org/I190249584"],"apc_list":null,"apc_paid":null,"fwci":4.4172,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94801451,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"243","last_page":"255"},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.992900013923645,"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/computer-science","display_name":"Computer science","score":0.7080454230308533},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.6815581321716309},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.615670919418335},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5524590611457825},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5508987903594971},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.5178818702697754},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5060557723045349},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.48451656103134155},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47414323687553406},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47371429204940796},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.43192508816719055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3139303922653198}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7080454230308533},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.6815581321716309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.615670919418335},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5524590611457825},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5508987903594971},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.5178818702697754},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5060557723045349},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.48451656103134155},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47414323687553406},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47371429204940796},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.43192508816719055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3139303922653198},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2837614.2837646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837646","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2837646&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1511.01838","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.01838","pdf_url":"https://arxiv.org/pdf/1511.01838","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":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2837614.2837646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837646","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2837646&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3520111107","display_name":"Automated Complexity Analysis via Transformations","funder_award_id":"P 25781","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6783783255","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6900203326","display_name":null,"funder_award_id":"P25781","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/W2258276823.pdf","grobid_xml":"https://content.openalex.org/works/W2258276823.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W15833160","https://openalex.org/W144896759","https://openalex.org/W383107379","https://openalex.org/W419130258","https://openalex.org/W912214939","https://openalex.org/W1503772705","https://openalex.org/W1508002867","https://openalex.org/W1509393451","https://openalex.org/W1521275321","https://openalex.org/W1583784885","https://openalex.org/W1595456961","https://openalex.org/W1636902686","https://openalex.org/W1952931766","https://openalex.org/W1971256104","https://openalex.org/W1980647766","https://openalex.org/W1993439083","https://openalex.org/W2001623513","https://openalex.org/W2015488964","https://openalex.org/W2020692742","https://openalex.org/W2021277357","https://openalex.org/W2034297217","https://openalex.org/W2063179190","https://openalex.org/W2073629816","https://openalex.org/W2112207350","https://openalex.org/W2132750992","https://openalex.org/W2138657070","https://openalex.org/W2141493279","https://openalex.org/W2160513937","https://openalex.org/W2169724594","https://openalex.org/W2252870350","https://openalex.org/W2294530123","https://openalex.org/W2408316610","https://openalex.org/W2408512871","https://openalex.org/W2803623102","https://openalex.org/W2911303149","https://openalex.org/W3098546239","https://openalex.org/W3106191599","https://openalex.org/W4242321992","https://openalex.org/W4299138792","https://openalex.org/W4393967107"],"related_works":["https://openalex.org/W2327776271","https://openalex.org/W2105038944","https://openalex.org/W1504200807","https://openalex.org/W4388327399","https://openalex.org/W2082636129","https://openalex.org/W3003471035","https://openalex.org/W1583470866","https://openalex.org/W2970311880","https://openalex.org/W2075449032","https://openalex.org/W1501278571"],"abstract_inverted_index":{"In":[0],"this":[1,62],"paper,":[2],"we":[3,33],"analyze":[4],"the":[5,12],"complexity":[6,40,54,84],"of":[7,48,61],"functional":[8],"programs":[9,50],"written":[10],"in":[11,78],"interaction-net":[13,49],"computation":[14],"model,":[15],"an":[16],"asynchronous,":[17],"parallel":[18,46],"and":[19,30,38,45,76],"confluent":[20],"model":[21],"that":[22],"generalizes":[23],"linear-logic":[24],"proof":[25],"nets.":[26],"Employing":[27],"user-defined":[28],"sized":[29],"scheduled":[31],"types,":[32],"certify":[34],"concrete":[35],"time,":[36],"space":[37],"space-time":[39],"bounds":[41],"for":[42],"both":[43],"sequential":[44],"reductions":[47],"by":[51],"suitably":[52],"assigning":[53],"potentials":[55],"to":[56,82],"typed":[57],"nodes.":[58],"The":[59,70],"relevance":[60],"approach":[63],"is":[64,73],"illustrated":[65],"on":[66],"archetypal":[67],"programming":[68],"examples.":[69],"provided":[71],"analysis":[72],"precise,":[74],"compositional":[75],"is,":[77],"theory,":[79],"not":[80],"restricted":[81],"particular":[83],"classes.":[85]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}