{"id":"https://openalex.org/W2914598255","doi":"https://doi.org/10.1145/3087801","title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","display_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2914598255","doi":"https://doi.org/10.1145/3087801","mag":"2914598255"},"language":"en","primary_location":{"id":"doi:10.1145/3087801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9907000064849854,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9858999848365784,"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.7937201261520386},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5720283389091492},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4837755858898163},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.48270320892333984},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41755861043930054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35228145122528076},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3273240327835083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30285438895225525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23451673984527588},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.10736909508705139},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10683661699295044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7937201261520386},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5720283389091492},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4837755858898163},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.48270320892333984},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41755861043930054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35228145122528076},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3273240327835083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30285438895225525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23451673984527588},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.10736909508705139},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10683661699295044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2116677773","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2372895815","https://openalex.org/W2167833628","https://openalex.org/W2155261584","https://openalex.org/W2349474539","https://openalex.org/W2766289720","https://openalex.org/W1528719522"],"abstract_inverted_index":{"The":[0,92,130,182,232,263,348,358,405,426,450,521],"ACM":[1,49,60,173,484],"Symposium":[2,78,108,174],"on":[3,16,53,79,85,109,175,487,504,517],"Principles":[4,80,123,184],"of":[5,11,29,81,124,169,177,185,210,242,276,292,344,381,394,403,541],"Distributed":[6,82,110,119,125,137,186,200,397,441,519,542],"Computing":[7,111,126,138,178,187,398],"(PODC)":[8],"is":[9,45,191,254,297,316],"one":[10],"the":[12,22,48,59,70,76,96,106,113,122,167,170,208,221,243,250,280,345,366,395,401,436,461,501,514],"premier":[13],"international":[14],"conferences":[15],"algorithms":[17,31],"for":[18,98,154,161,196,202,246,270,388,435,460,466,510],"distributed":[19],"computation,":[20],"including":[21],"theory,":[23],"design,":[24],"analysis,":[25],"implementation,":[26],"and":[27,41,58,105,121,151,223,314,337,378,399,421,447,468,491,508,513,538,551],"application":[28],"such":[30],"to":[32,39,148,193,220,290,432,457],"domains":[33],"stretching":[34],"from":[35,279],"traditional":[36],"long-haul":[37],"networks":[38],"mobile":[40],"sensor":[42],"networks.":[43],"PODC":[44,74,104,479],"sponsored":[46,102],"by":[47,103,256,299,339,352,372,411,535,544],"Special":[50,61],"Interest":[51,62],"Group":[52,63],"theoretical":[54],"computer":[55],"science,":[56],"SIGACT,":[57],"operating":[64],"systems,":[65],"SIGOPS.":[66],"This":[67,477],"volume":[68,93],"contains":[69],"papers":[71,218,269,325,384],"presented":[72,141,192,431,456],"at":[73,142,213,249,340,375],"2017,":[75],"36th":[77],"Computing,":[83,120,512],"held":[84],"July":[86],"25-27,":[87],"2017":[88,131,144,183,369,483],"in":[89,118,136,145,166,180,224,260,303,326,390,400,471,489,530],"Washington,":[90],"DC.":[91],"also":[94,266,495,524],"includes":[95],"citations":[97],"two":[99,496,526],"awards":[100],"jointly":[101],"EATCS":[107],"(DISC):":[112],"Edsger":[114,132],"W.":[115,133],"Dijkstra":[116,134],"Prize":[117,135],"Doctoral":[127,188],"Dissertation":[128,189],"Award.":[129],"will":[139,321,385],"be":[140,287,386],"DISC":[143],"Vienna,":[146],"Austria,":[147],"Elizabeth":[149],"Borowsky":[150],"Eli":[152,536],"Gafni":[153],"their":[155],"paper":[156,259,282,302,334,437,462],"\"Generalized":[157],"FLP":[158],"Impossibility":[159],"Result":[160],"t-resilient":[162],"Asynchronous":[163],"Computations\"":[164],"published":[165],"Proceedings":[168],"25th":[171],"Annual":[172],"Theory":[176],"(STOC)":[179],"1993.":[181],"Award":[190,429,454],"Mohsen":[194],"Ghaffari,":[195],"his":[197],"dissertation":[198],"\"Improved":[199],"Algorithms":[201,490,543],"Fundamental":[203],"Graph":[204],"Problems,\"":[205],"written":[206],"under":[207],"supervision":[209],"Nancy":[211,373],"Lynch":[212,374],"MIT.":[214,376],"There":[215,493],"were":[216,227,494],"154":[217,244],"submitted":[219,333],"symposium,":[222],"addition":[225],"there":[226],"14":[228],"brief":[229,273,295],"announcement":[230,296],"submissions.":[231],"Program":[233,264,346,359],"Committee":[234,265,360],"selected":[235,267,383],"38":[236],"contributions,":[237],"or":[238,311,330],"less":[239],"than":[240,354],"25%":[241],"submissions,":[245],"regular":[247,281],"presentations":[248],"symposium.":[251],"Each":[252,294],"presentation":[253,271],"accompanied":[255,298],"a":[257,300,391],"ten-page":[258],"this":[261,304],"volume.":[262,305],"21":[268],"as":[272,323],"announcements":[274,307],"(some":[275],"which":[277],"came":[278],"submissions":[283],"that":[284,318],"could":[285],"not":[286],"accepted":[288],"due":[289],"paucity":[291],"space).":[293],"three-page":[301],"These":[306],"present":[308],"ongoing":[309],"work":[310],"recent":[312],"results,":[313],"it":[315],"expected":[317],"these":[319],"results":[320],"appear":[322],"full":[324],"other":[327],"conference":[328],"proceedings":[329],"journals.":[331],"Every":[332],"was":[335,350,430,455,480],"read":[336],"evaluated":[338],"least":[341],"three":[342,408],"members":[343],"Committee.":[347],"committee":[349],"assisted":[351],"more":[353],"140":[355],"external":[356],"reviewers.":[357],"made":[361],"its":[362],"final":[363],"decisions":[364],"during":[365],"April":[367],"24-25,":[368],"meeting":[370],"hosted":[371],"Revised":[377],"expanded":[379],"versions":[380],"several":[382],"considered":[387],"publication":[389],"special":[392],"issue":[393],"journal":[396],"Journal":[402],"ACM.":[404],"program":[406,523],"included":[407,525],"keynote":[409],"lectures":[410],"Guy":[412],"Blelloch":[413],"(CMU,":[414],"USA),":[415,420],"Maurice":[416],"Herlihy":[417],"(Brown":[418],"University,":[419],"Rosario":[422],"Gennaro":[423],"(CUNY,":[424],"USA).":[425],"Best":[427,451],"Paper":[428,453],"Michael":[433],"Elkin":[434],"\"A":[438],"Simple":[439],"Deterministic":[440],"MST":[442],"Algorithm,":[443],"with":[444,474,482,499,533],"Near-Optimal":[445],"Time":[446],"Message":[448],"Complexities.\"":[449],"Student":[452],"Peter":[458],"Davies":[459],"\"Exploiting":[463],"Spontaneous":[464],"Transmissions":[465],"Broadcasting":[467],"Leader":[469],"Election":[470],"Radio,\"":[472],"coauthored":[473],"Artur":[475],"Czumaj.":[476],"year":[478],"co-located":[481,498],"SPAA":[485],"(Symposium":[486],"Parallelism":[488],"Architectures).":[492],"workshops":[497],"PODC:":[500],"4th":[502],"Workshop":[503,516],"Adaptive":[505],"Resource":[506],"Management":[507],"Scheduling":[509],"Cloud":[511],"5th":[515],"Biological":[518],"Algorithms.":[520],"broader":[522],"tutorials:":[527],"Recent":[528],"Advances":[529],"R/W":[531],"Computability":[532],"Speculations":[534],"Gafni,":[537],"High-Level":[539],"Specification":[540],"Y.":[545],"Annie":[546],"Liu,":[547],"Scott":[548],"D.":[549],"Stoller,":[550],"Bo":[552],"Lin.":[553]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}