default search action
PODC 2018: Egham, United Kingdom
- Calvin Newport, Idit Keidar:
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018. ACM 2018
Awards
- Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld:
2018 Edsger W. Dijkstra Prize in Distributed Computing. 1 - Lorenzo Alvisi, Idit Keidar, Andréa W. Richa, Alexander A. Schwarzmann
:
2018 Doctoral Dissertation Award. 3
Keynote 1
- Robert Peglar:
Overview of Persistent Memory in Distributed Systems Architecture - Past, Present, Future. 5
Session 1A: Persistent Memory
- Idit Keidar:
Session details: Session 1A: Persistent Memory. - Hagit Attiya
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. 7-16 - Wojciech M. Golab, Danny Hendler:
Recoverable Mutual Exclusion Under System-Wide Failures. 17-26 - Adam Alon, Adam Morrison:
Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity. 27-36 - Matej Pavlovic, Alex Kogan, Virendra J. Marathe, Tim Harris:
Brief Announcement: Persistent Multi-Word Compare-and-Swap. 37-39
Session 1B: Shared Memory Theory
- Dan Alistarh:
Session details: Session 1B: Shared Memory Theory. - Hagit Attiya
Separating Lock-Freedom from Wait-Freedom. 41-50 - Marcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui
Passing Messages while Sharing Memory. 51-60 - Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. 61-70 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Classification of Deterministic Objects via Set Agreement Power. 71-80 - Hengfeng Wei, Yu Huang, Jian Lu:
Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited. 81-83
Session 1C: Wireless Networks
- Janna Burman:
Session details: Session 1C: Wireless Networks. - Magnús M. Halldórsson
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. 85-93 - Yi-Jun Chang
The Energy Complexity of Broadcast. 95-104 - Tomasz Jurdzinski
Deterministic Digital Clustering of Wireless Ad Hoc Networks. 105-114 - Marek Klonowski
Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs. 115-117
Session 1D: Graph Algorithms
- Peter Robinson:
Session details: Session 1D: Graph Algorithms. - Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
Round- and Message-Optimal Distributed Graph Algorithms. 119-128 - Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. 129-138 - Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. 139-148 - Michal Dory:
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. 149-158 - Christian Konrad, Viktor Zamaraev
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. 159-161 - Ravi B. Boppana, Magnús M. Halldórsson
Brief Announcement: Simple and Local Independent Set Approximation. 163-165
Keynote 2
- Graham Cormode
Data Summarization and Distributed Computation. 167-168
Session 2A: Approximation and Learning
- Idit Keidar:
Session details: Session 2A: Approximation and Learning. - Dan Alistarh, Christopher De Sa, Nikola Konstantinov
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory. 169-178 - Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su:
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. 179-188 - Weiming Feng, Yitong Yin:
On Local Distributed Sampling and Counting. 189-198
Session 2B: Routing and Leader Election
- Mohsen Ghaffari:
Session details: Session 2B: Routing and Leader Election. - Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. 199-205 - Michael Elkin, Ofer Neiman:
Near-Optimal Distributed Routing with Low Memory. 207-216 - Assaf Yifrach, Yishay Mansour:
Fair Leader Election for Rational Agents in Asynchronous Rings and Networks. 217-226 - Seth Gilbert
Leader Election in Well-Connected Graphs. 227-236 - Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Brief Announcement: Beeping a Time-Optimal Leader Election. 237-239 - Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi:
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. 241-243
Session 2C: Security, Blockchains, and Replication
- Gregory V. Chockler:
Session details: Session 2C: Security, Blockchains, and Replication. - Maurice Herlihy:
Atomic Cross-Chain Swaps. 245-254 - Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena:
Interactive Distributed Proofs. 255-264 - Rishabh Bhadauria
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited. 265-267 - Ali Shoker:
Brief Announcement: Sustainable Blockchains through Proof of eXercise. 269-271 - Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Partially Replicated Causally Consistent Shared Memory. 273-275 - Russell L. Jones, Muhammad Samir Khan, Nitin H. Vaidya:
Brief Announcement: Optimal Record and Replay under Causal Consistency. 277-279 - Bharath Balasubramanian, Richard D. Schlichting, Pamela Zave:
Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed Services. 281-284
Session 2D: Consensus
- Chryssis Georgiou:
Session details: Session 2D: Consensus. - Guy Goren, Yoram Moses:
Silence. 285-294 - Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. 295-304 - Mohsen Ghaffari, Johannes Lengler:
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. 305-313 - John Augustine, Anisur Rahaman Molla, Gopal Pandurangan:
Sublinear Message Bounds for Randomized Agreement. 315-324 - Matthias Függer, Thomas Nowak, Manfred Schwarz:
Tight Bounds for Asymptotic and Approximate Consensus. 325-334
Keynote 3
- Keren Censor-Hillel:
Barriers due to Congestion and Two Ways to Deal With Them. 335
Session 3A: Congest
- Idit Keidar:
Session details: Session 3A: Congest. - François Le Gall, Frédéric Magniez:
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. 337-346 - Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. 347-356 - Mohsen Ghaffari, Krzysztof Nowicki:
Congested Clique Algorithms for the Minimum Cut Problem. 357-366
Session 3B: Concurrency
- Marcos K. Aguilera, Tudor David, Rachid Guerraoui
Locking Timestamps versus Locking Objects. 367-376 - Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. 377-386 - Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. 387-396 - Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon:
Population Stability: Regulating Size in the Presence of an Adversary. 397-406 - Adones Rukundo, Aras Atalar, Philippas Tsigas:
Brief Announcement: 2D-Stack - A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better Performance. 407-409 - Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Brief Announcement: Performance Prediction for Coarse-Grained Locking. 411-413 - Tong Jia, Ying Li, Zhonghai Wu:
Brief Announcement: Automatic Log Enhancement for Fault Diagnosis. 415-417
Session 3C: Coloring
- Magnús M. Halldórsson:
Session details: Session 3C: Coloring. - Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. 419-425 - Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Delta-Coloring. 427-436 - Leonid Barenboim, Michael Elkin, Uri Goldenberg:
Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. 437-446
Session 3D: Graphs and Population
- Michael Elkin:
Session details: Session 3D: Graphs and Population. - Andrey Kupavskii, Emo Welzl:
Lower Bounds for Searching Robots, some Faulty. 447-453 - Orr Fischer, Uri Meir, Rotem Oshman:
Distributed Uniformity Testing. 455-464 - Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. 465-474 - Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Population Protocols Are Fast. 475-477 - Janna Burman, Joffroy Beauquier, Devan Sohier:
Brief Announcement: Space-Optimal Naming in Population Protocols. 479-481 - Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa:
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. 483-485
Tutorials
- Dan Alistarh:
A Brief Tutorial on Distributed and Concurrent Machine Learning. 487-488 - Lewis Tseng:
Erasure Coding in Object Stores: Challenges and Opportunities. 489 - Alexey Gotsman:
Tutorial: Consistency Choices in Modern Distributed Systems. 491 - Stefan Schmid:
From Self-Stabilization to Self-Optimization: Principles of Distributed Network Design. 493
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-11-15 19:44 CET 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: