Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th PODC 2017: Washington, DC, USA
- Elad Michael Schiller, Alexander A. Schwarzmann:
Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017. ACM 2017, ISBN 978-1-4503-4992-5
Keynote 1
- Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. 1
Session 1
- Artur Czumaj, Peter Davies
:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. 3-12 - Boaz Patt-Shamir, Will Rosenbaum:
The Space Requirement of Local Forwarding on Acyclic Networks. 13-22 - Seth Gilbert, Fabian Kuhn, Chaodong Zheng:
Communication Primitives in Cognitive Radio Networks. 23-32 - Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. 33-42 - Calvin C. Newport:
Gossip in a Smartphone Peer-to-Peer Network. 43-52
Session 2
- Naama Ben-David, Guy E. Blelloch:
Analyzing Contention and Backoff in Asynchronous Shared Memory. 53-62 - Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
A Layered Architecture for Erasure-Coded Consistent Distributed Storage. 63-72 - Natacha Crooks, Youer Pu, Lorenzo Alvisi, Allen Clement:
Seeing is Believing: A Client-Centric Specification of Database Isolation. 73-82 - Gregory V. Chockler, Alexander Spiegelman:
Space Complexity of Fault-Tolerant Register Emulations. 83-92 - Eric Ruppert:
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. 93-94 - Pankaj Khanchandani, Roger Wattenhofer:
Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers. 95-96 - Mohsen Lesani:
Brief Announcement: Fence Insertion for Straight-line Programs is in P. 97-99
Session 3
- Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL Problems on Grids. 101-110 - Orr Fischer, Shay Gershtein, Rotem Oshman:
On the Multiparty Communication Complexity of Testing Triangle-Freeness. 111-120 - Weiming Feng, Yuxin Sun, Yitong Yin:
What Can be Sampled Locally? 121-130 - Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su:
Distributed MST and Routing in Almost Mixing Time. 131-140 - Mohsen Ghaffari:
Distributed MIS via All-to-All Communication. 141-149 - Hugues Mercier, Laurent Hayez, Miguel Matos:
Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination. 151-153
Keynote 2
- Maurice Herlihy:
Blockchains and the Future of Distributed Computing. 155
Session 4
- Michael Elkin:
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities. 157-163 - Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. 165-174 - Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. 175-184 - Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. 185-194 - Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
Brief Announcement: How Large is your Graph? 195-197 - Keren Censor-Hillel, Michal Dory:
Brief Announcement: Distributed Approximation for Tree Augmentation. 199-201 - Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou:
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. 203-205 - Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. 207-209
Session 5
- Wojciech M. Golab, Danny Hendler:
Recoverable Mutual Exclusion in Sub-logarithmic Time. 211-220 - George Giakkoupis, Philipp Woelfel:
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. 221-229 - Alex Kogan, Yossi Lev:
Transactional Lock Elision Meets Combining. 231-240 - Asa Dan, Rajit Manohar, Yoram Moses:
On Using Time Without Clocks via Zigzag Causality. 241-250 - Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures. 251-253 - Seth Gilbert, Peter Robinson, Suman Sourav:
Brief Announcement: Gossiping with Latencies. 255-257 - Shankha Chatterjee, Wojciech M. Golab:
Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems. 259-261
Session 6
- Sandeep S. Kulkarni, Nitin H. Vaidya:
Effectiveness of Delaying Timestamp Computation. 263-272 - Seth Gilbert, Calvin C. Newport:
Symmetry Breaking with Noisy Processes. 273-282 - Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. 283-292 - Trevor Brown:
A Template for Implementing Fast Lock-free Trees Using HTM. 293-302 - Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. 303-312
Keynote 3
- Rosario Gennaro:
Verifiable Outsourced Computation: A Survey. 313
Session 7
- Rafael Pass, Elaine Shi:
FruitChains: A Fair Blockchain. 315-324 - Gadi Taubenfeld:
Coordination Without Prior Agreement. 325-334 - Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. 335-344 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life Beyond Set Agreement. 345-354 - Benjamin Bengfort, Pete Keleher:
Brief Announcement: Hierarchical Consensus. 355-357 - Bingsheng Zhang, Hong-Sheng Zhou:
Brief Announcement: Statement Voting and Liquid Democracy. 359-361 - Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Brief Announcement: Rapid Asynchronous Plurality Consensus. 363-365 - Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein:
Brief Announcement: Object Oriented Consensus. 367-369
Session 8
- Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenon. 371-380 - Taisuke Izumi, François Le Gall:
Triangle Finding and Listing in CONGEST Networks. 381-389 - Gianluca De Marco, Grzegorz Stachowiak:
Asynchronous Shared Channel. 391-400 - Hamed Omidvar, Massimo Franceschetti:
Self-organized Segregation on the Grid. 401-410 - Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks. 411-413 - Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Secure Self-Stabilizing Computation. 415-417 - Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. 419-421
Session 9
- Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. 423-430 - James Aspnes:
Clocked Population Protocols. 431-440 - L. Elisa Celis, Peter M. Krafft, Nisheeth K. Vishnoi:
A Distributed Learning Dynamics in Social Groups. 441-450 - Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. 451-453 - Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer:
Brief Announcement: Byzantine-Tolerant Machine Learning. 455-457 - Alexander Bagnall, Samuel Merten, Gordon Stewart:
Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret. 459-461
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
