default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th PODC 2015: Donostia-San Sebastián, Spain
- Chryssis Georgiou, Paul G. Spirakis:
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015. ACM 2015, ISBN 978-1-4503-3617-8
Keynote Lecture
- Christos H. Papadimitriou, Santosh S. Vempala:
Cortical Computation. 1-2
Session 1
- Mohsen Ghaffari:
Near-Optimal Scheduling of Distributed Algorithms. 3-12 - Arne Ludwig, Jan Marcinkowski
, Stefan Schmid:
Scheduling Loop-free Network Updates: It's Good to Relax! 13-22 - Liam Roditty, Roei Tov:
New Routing Techniques and their Applications. 23-32 - Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
Brief Announcement: Routing the Internet with Very Few Entries. 33-35
Session 2
- Othon Michail:
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. 37-46 - Dan Alistarh, Rati Gelashvili, Milan Vojnovic:
Fast and Exact Majority in Population Protocols. 47-56 - Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch:
Distributed House-Hunting in Ant Colonies. 57-66 - Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida A. Bazzi, Andréa W. Richa, Christian Scheideler:
Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. 67-69
Session 3
- Valerie King, Shay Kutten, Mikkel Thorup:
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. 71-80 - Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow: Extended Abstract. 81-90 - James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, Michele Scquizzato:
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. 91-100 - Rafail Ostrovsky, Will Rosenbaum:
Fast Distributed Almost Stable Matchings. 101-108
Session 4
- Nancy A. Lynch, Calvin Newport:
A (Truly) Local Broadcast Layer for Unreliable Radio Networks. 109-118 - Seth Gilbert, Fabian Kuhn, Calvin Newport, Chaodong Zheng:
Efficient Communication in Cognitive Radio Networks. 119-128 - Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch:
A Local Broadcast Layer for the SINR Network Model. 129-138 - Fabian Fuchs:
Brief Announcement: Fast and Simple Node Coloring in the SINR Model. 139-141
Session 5
- Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. 143-152 - Christoph Lenzen, Boaz Patt-Shamir:
Fast Partial Distance Estimation and Applications. 153-162 - Mohsen Ghaffari, Rajan Udwani:
Brief Announcement: Distributed Single-Source Reachability. 163-165 - Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila:
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. 167-169
Keynote Lecture
- Moti Yung:
The "Mobile Adversary" Paradigm in Distributed Computation and Systems. 171-172
Session 6
- Hagit Attiya, Danny Hendler, Philipp Woelfel:
Trading Fences with RMRs and Separating Memory Models. 173-182 - Ohad Ben-Baruch, Danny Hendler:
The Price of being Adaptive. 183-192 - Zahra Aghazadeh, Philipp Woelfel:
On the Time and Space Complexity of ABA Prevention and Detection. 193-202 - Jian Tang, Mikel Larrea, Sergio Arévalo, Ernesto Jiménez:
Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels. 203-205
Session 7
- Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Impossibility Results for Distributed Transactional Memory. 207-215 - Sebastiano Peluso, Roberto Palmieri, Paolo Romano, Binoy Ravindran, Francesco Quaglia:
Disjoint-Access Parallelism: Impossibility, Possibility, and Cost of Transactional Memory Implementations. 217-226 - Victor Bushkov, Rachid Guerraoui:
Safety-Liveness Exclusion in Distributed Computing. 227-236 - Maciej Kokocinski, Tadeusz Kobus, Pawel T. Wojciechowski:
Brief Announcement: Eventually Consistent Linearizability. 237-239
Session 8
- Keren Censor-Hillel, Erez Petrank, Shahar Timnat:
Help! 241-250 - Dan Alistarh, Thomas Sauerwald, Milan Vojnovic:
Lock-Free Algorithms under Stochastic Schedulers. 251-260 - Trevor Alexander Brown:
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way. 261-270 - Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. 271-280
Session 9
- Juan A. Garay, Jonathan Katz, Björn Tackmann, Vassilis Zikas:
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality. 281-290 - Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. 291-300 - Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. 301-310 - Shlomi Dolev, Thomas Petig, Elad Michael Schiller:
Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks. 311-313
Session 10
- Mor Baruch, Pierre Fraigniaud, Boaz Patt-Shamir:
Randomized Proof-Labeling Schemes. 315-324 - Ran Wolff:
Distributed Convex Thresholding. 325-334 - Laurent Feuilloley:
Brief Announcement: Average Complexity for the LOCAL Model. 335-337 - Giuseppe Antonio Di Luna, Roberto Baldoni:
Brief Announcement: Investigating the Cost of Anonymity on Dynamic Networks. 339-341
Keynote Lecture
- Christine Markarian, Friedhelm Meyer auf der Heide:
Online Resource Leasing. 343-344
Session 11
- Leonid Barenboim:
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks. 345-354 - Mark Braverman, Rotem Oshman:
On Information Complexity in the Broadcast Model. 355-364 - Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How To Elect a Leader Faster than a Tournament. 365-374
Session 12
- Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
The Weakest Failure Detector for Eventual Consistency. 375-384 - Hagit Attiya, Faith Ellen, Adam Morrison:
Limitations of Highly-Available Eventually-Consistent Data Stores. 385-394 - Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura:
Computing Weak Consistency in Polynomial Time: [Extended Abstract]. 395-404
Session 13
- Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. 405-412 - Bernhard Haeupler, Dahlia Malkhi:
Distributed Resource Discovery in Sub-Logarithmic Time. 413-419 - Tomasz Jurdzinski, Grzegorz Stachowiak:
The Cost of Synchronizing Multiple-Access Channels. 421-430 - Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
Leveraging Multiple Channels in Ad Hoc Networks. 431-440
Session 14
- Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. 441-450 - Lewis Tseng, Nitin H. Vaidya:
Fault-Tolerant Consensus in Directed Graphs. 451-460 - Zohir Bouzid, Achour Mostéfaoui, Michel Raynal:
Minimal Synchrony for Byzantine Consensus. 461-470 - Silvia Bonomi, Shlomi Dolev, Maria Potop-Butucaru, Michel Raynal:
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstract. 471-479 - Merav Parter:
Dual Failure Resilient BFS Structure. 481-490
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 2025-12-04 01:26 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:
