{"id":"https://openalex.org/W2153458296","doi":"https://doi.org/10.1145/2048066.2048101","title":"Two for the price of one","display_name":"Two for the price of one","publication_year":2011,"publication_date":"2011-10-22","ids":{"openalex":"https://openalex.org/W2153458296","doi":"https://doi.org/10.1145/2048066.2048101","mag":"2153458296"},"language":"en","primary_location":{"id":"doi:10.1145/2048066.2048101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2048066.2048101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications","raw_type":"proceedings-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/A5045088961","display_name":"Sebastian Burckhardt","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sebastian Burckhardt","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086447301","display_name":"Daan Leijen","orcid":"https://orcid.org/0000-0003-1027-5430"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daan Leijen","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013989748","display_name":"Caitlin Sadowski","orcid":"https://orcid.org/0000-0002-7742-2784"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Caitlin Sadowski","raw_affiliation_strings":["University of California at Santa Cruz, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074457721","display_name":"Jaeheon Yi","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jaeheon Yi","raw_affiliation_strings":["University of California at Santa Cruz, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114248503","display_name":"Thomas Ball","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Ball","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9255,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.96741532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"427","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8801305294036865},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7244249582290649},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.704108476638794},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.6459029316902161},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5538307428359985},{"id":"https://openalex.org/keywords/bulk-synchronous-parallel","display_name":"Bulk synchronous parallel","score":0.5487037301063538},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.503673255443573},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.5003585815429688},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.46657976508140564},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4296696186065674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4283272624015808},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.41498151421546936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3118554651737213},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25014370679855347}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8801305294036865},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7244249582290649},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.704108476638794},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.6459029316902161},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5538307428359985},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.5487037301063538},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.503673255443573},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.5003585815429688},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.46657976508140564},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4296696186065674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4283272624015808},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.41498151421546936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3118554651737213},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25014370679855347}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2048066.2048101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2048066.2048101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W46412898","https://openalex.org/W200699361","https://openalex.org/W1805323477","https://openalex.org/W1864118766","https://openalex.org/W1884578711","https://openalex.org/W1965756321","https://openalex.org/W1967890297","https://openalex.org/W1986195981","https://openalex.org/W1995288535","https://openalex.org/W1999707021","https://openalex.org/W2000873501","https://openalex.org/W2001496424","https://openalex.org/W2007009457","https://openalex.org/W2010929544","https://openalex.org/W2011055092","https://openalex.org/W2014832211","https://openalex.org/W2023614281","https://openalex.org/W2028423097","https://openalex.org/W2035829578","https://openalex.org/W2051716170","https://openalex.org/W2069718764","https://openalex.org/W2073065242","https://openalex.org/W2096403564","https://openalex.org/W2097279136","https://openalex.org/W2097717378","https://openalex.org/W2112648314","https://openalex.org/W2122514069","https://openalex.org/W2122532513","https://openalex.org/W2126884146","https://openalex.org/W2129687053","https://openalex.org/W2145087641","https://openalex.org/W2154709372","https://openalex.org/W2158794422","https://openalex.org/W2167744164","https://openalex.org/W2172013743","https://openalex.org/W2294191420","https://openalex.org/W2597525217","https://openalex.org/W4233547058","https://openalex.org/W4235385348","https://openalex.org/W4244157805","https://openalex.org/W4249224771"],"related_works":["https://openalex.org/W2070732426","https://openalex.org/W2357113990","https://openalex.org/W1177194838","https://openalex.org/W2348761119","https://openalex.org/W2099112948","https://openalex.org/W2146067253","https://openalex.org/W1586380695","https://openalex.org/W1581218886","https://openalex.org/W2076357067","https://openalex.org/W2353488209"],"abstract_inverted_index":{"Parallel":[0],"or":[1],"incremental":[2,46],"versions":[3],"of":[4,82],"an":[5],"algorithm":[6,52,58],"can":[7,29,41],"significantly":[8],"outperform":[9],"their":[10],"counterparts,":[11],"but":[12],"are":[13],"often":[14],"difficult":[15],"to":[16,24],"develop.":[17],"Programming":[18],"models":[19],"that":[20,37],"provide":[21],"appropriate":[22],"abstractions":[23,40],"decompose":[25],"data":[26],"and":[27,45,71],"tasks":[28],"simplify":[30],"parallelization.":[31],"We":[32,48],"show":[33],"in":[34],"this":[35],"work":[36],"the":[38,83],"same":[39],"enable":[42],"both":[43],"parallel":[44,54,62,84],"execution.":[47],"present":[49],"a":[50,60,78],"novel":[51],"for":[53,69],"self-adjusting":[55],"computation.":[56,85],"This":[57],"extends":[59],"deterministic":[61],"programming":[63],"model":[64],"(concurrent":[65],"revisions)":[66],"with":[67],"support":[68],"recording":[70],"repeating":[72],"computations.":[73],"On":[74,86],"record,":[75],"we":[76,88],"construct":[77],"dynamic":[79],"dependence":[80],"graph":[81],"repeat,":[87],"reexecute":[89],"only":[90],"parts":[91],"whose":[92],"dependencies":[93],"have":[94],"changed.":[95]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}