{"id":"https://openalex.org/W2992781546","doi":"https://doi.org/10.1145/3335772.3335782","title":"A new solution of Dijkstra's concurrent programming problem","display_name":"A new solution of Dijkstra's concurrent programming problem","publication_year":2019,"publication_date":"2019-10-09","ids":{"openalex":"https://openalex.org/W2992781546","doi":"https://doi.org/10.1145/3335772.3335782","mag":"2992781546"},"language":"en","primary_location":{"id":"doi:10.1145/3335772.3335782","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3335772.3335782","pdf_url":null,"source":{"id":"https://openalex.org/S4306462870","display_name":"Association for Computing Machinery eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: the Works of Leslie Lamport","raw_type":"book-chapter"},"type":"book-chapter","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/A5040623453","display_name":"Leslie Lamport","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152550","display_name":"Abt Global (United States)","ror":"https://ror.org/0502afh35","country_code":"US","type":"company","lineage":["https://openalex.org/I4210152550"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leslie Lamport","raw_affiliation_strings":["Massachusetts Computer Associates, Inc"],"affiliations":[{"raw_affiliation_string":"Massachusetts Computer Associates, Inc","institution_ids":["https://openalex.org/I4210152550"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040623453"],"corresponding_institution_ids":["https://openalex.org/I4210152550"],"apc_list":null,"apc_paid":null,"fwci":1.3135,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.847082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9778000116348267,"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.9778000116348267,"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/concurrency","display_name":"Concurrency","score":0.7375895977020264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6984304785728455},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6938083171844482},{"id":"https://openalex.org/keywords/citation","display_name":"Citation","score":0.6365647315979004},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4541768729686737},{"id":"https://openalex.org/keywords/concurrent-object-oriented-programming","display_name":"Concurrent object-oriented programming","score":0.4325261116027832},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.2922198176383972},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21596971154212952},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.17437830567359924},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.09671446681022644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05841946601867676},{"id":"https://openalex.org/keywords/reactive-programming","display_name":"Reactive programming","score":0.05711925029754639}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7375895977020264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6984304785728455},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6938083171844482},{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.6365647315979004},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4541768729686737},{"id":"https://openalex.org/C3701939","wikidata":"https://www.wikidata.org/wiki/Q5159109","display_name":"Concurrent object-oriented programming","level":5,"score":0.4325261116027832},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.2922198176383972},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21596971154212952},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.17437830567359924},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.09671446681022644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05841946601867676},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.05711925029754639},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3335772.3335782","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3335772.3335782","pdf_url":null,"source":{"id":"https://openalex.org/S4306462870","display_name":"Association for Computing Machinery eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: the Works of Leslie Lamport","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2040637509","https://openalex.org/W2060375170","https://openalex.org/W2170523074","https://openalex.org/W2182780382"],"related_works":["https://openalex.org/W2007551100","https://openalex.org/W1595842514","https://openalex.org/W2133348162","https://openalex.org/W4252341711","https://openalex.org/W3005875561","https://openalex.org/W3023364199","https://openalex.org/W2611825707","https://openalex.org/W2086685683","https://openalex.org/W2422465781","https://openalex.org/W1547394117"],"abstract_inverted_index":{"research-article":[0],"Share":[1],"on":[2,80],"A":[3],"new":[4],"solution":[5],"of":[6,30],"Dijkstra's":[7],"concurrent":[8],"programming":[9],"problem":[10],"Author:":[11],"Leslie":[12,31],"Lamport":[13],"Massachusetts":[14,18],"Computer":[15,19],"Associates,":[16,20],"Inc.":[17],"Inc.View":[21],"Profile":[22],"Authors":[23],"Info":[24],"&":[25],"Claims":[26],"Concurrency:":[27],"the":[28,81],"Works":[29],"LamportOctober":[32],"2019":[33],"Pages":[34],"171\u2013178https://doi.org/10.1145/3335772.3335782Published:04":[35],"October":[36],"2019Publication":[37],"History":[38],"4citation188DownloadsMetricsTotal":[39],"Citations4Total":[40],"Downloads188Last":[41],"12":[42],"Months14Last":[43],"6":[44],"weeks4":[45],"Get":[46],"Citation":[47,49,86],"AlertsNew":[48,85],"Alert":[50],"added!This":[51],"alert":[52,77],"has":[53,72],"been":[54,73],"successfully":[55],"added":[56],"and":[57],"will":[58,62],"be":[59,63],"sent":[60],"to:You":[61],"notified":[64],"whenever":[65],"a":[66,98],"record":[67],"that":[68],"you":[69],"have":[70],"chosen":[71],"cited.To":[74],"manage":[75],"your":[76,91],"preferences,":[78],"click":[79],"button":[82],"below.Manage":[83],"my":[84],"Alert!Please":[87],"log":[88],"in":[89],"to":[90,94,96],"account":[92],"Save":[93],"BinderSave":[95],"BinderCreate":[97],"New":[99],"BinderNameCancelCreateExport":[100],"CitationPublisher":[101],"SiteGet":[102],"Access":[103]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-02-24T19:35:01.260952","created_date":"2019-12-13T00:00:00"}