default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd PODC 2013: Montreal, QC, Canada
- Panagiota Fatourou, Gadi Taubenfeld:
ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013. ACM 2013, ISBN 978-1-4503-2065-8
Keynote addresses
- Michael Merritt:
Plenary talk. 1 - Nancy A. Lynch:
Athena lecture: distributed computing theory for wireless networks and mobile systems. 2 - Marc Snir:
Programming models for extreme-scale computing. 3
Concurrent data structures and objects
- Vassos Hadzilacos, Sam Toueg:
On deterministic abortable objects. 4-12 - Trevor Brown, Faith Ellen, Eric Ruppert:
Pragmatic primitives for non-blocking data structures. 13-22 - Rotem Oshman, Nir Shavit:
The SkipTrie: low-depth concurrent search without rebalancing. 23-32
Routing and distributed algorithms
- Shiri Chechik:
Compact routing schemes with improved stretch. 33-41 - Christoph Lenzen:
Optimal deterministic routing and sorting on the congested clique. 42-50 - Jeremy T. Fineman, Calvin C. Newport, Tonghe Wang:
Brief announcement: fair maximal independent sets in trees. 51-53 - Martin Hoefer, Thomas Sauerwald:
Brief announcement: threshold load balancing in networks. 54-56
Byzantine agreement
- Nicolas Braud-Santoni
, Rachid Guerraoui, Florian Huc:
Fast byzantine agreement. 57-64 - Nitin H. Vaidya, Vijay K. Garg:
Byzantine vector consensus in complete graphs. 65-73 - John Augustine, Gopal Pandurangan, Peter Robinson:
Fast byzantine agreement in dynamic networks. 74-83 - Dariusz R. Kowalski, Achour Mostéfaoui:
Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits. 84-91
Distributed algorithms and their complexity
- Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to meet asynchronously at polynomial cost. 92-99 - Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
On the complexity of universal leader election. 100-109 - Rachit Agarwal, Philip Brighten Godfrey:
Brief announcement: a simple stretch 2 distance oracle. 110-112 - Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Brief announcement: pareto optimal solutions to consensus and set consensus. 113-115
Brief announcements
- Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Brief announcement: self-stabilizing resource discovery algorithm. 116-118 - Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction. 119-121 - Lu Zhang, Xueyan Tang, Bingsheng He:
Brief announcement: on minimum interaction time for continuous distributed interactive computing. 122-124 - Lélia Blin, Sébastien Tixeuil:
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. 125-127 - Josh R. Karlin, Joud S. Khoury, Jared Saia, Mahdi Zamani:
Brief announcement: scalable anonymous communication with byzantine adversary. 128-130 - Samuel D. Johnson, Raissa M. D'Souza:
Brief announcement: brokerage and closure in a strategic model of social capital. 131-133 - Sam Whitlock, Colin Scott, Scott Shenker:
Brief announcement: techniques for programmatically troubleshooting distributed systems. 134-136
Distributed algorithms and their complexity
- Yuval Emek, Roger Wattenhofer:
Stone age distributed computing. 137-146 - Alex Scott, Peter Jeavons, Lei Xu:
Feedback from nature: an optimal distributed algorithm for maximal independent set selection. 147-156 - Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? 157-165
Fault tolerance in distributed systems
- Michel Raynal, Julien Stainer:
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. 166-175 - Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec:
Highly dynamic distributed computing with byzantine failures. 176-183 - Chen Chen, Roman Vitenberg, Hans-Arno Jacobsen:
Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe. 184-186 - Valerie King, Jared Saia:
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time. 187-189
Renaming and mutual exclusion
- Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Upper bound on the complexity of solving hard renaming. 190-199 - Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel:
Randomized loose renaming in O(log log n) time. 200-209 - Oksana Denysyuk, Luís E. T. Rodrigues:
Byzantine renaming in synchronous systems with t<N. 210-219 - Hagit Attiya, Danny Hendler, Smadar Levy:
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. 220-229
Social and peer to peer networks and mobile robots
- Yuezhou Lv, Thomas Moscibroda:
Fair and resilient incentive tree mechanisms. 230-239 - Edmund L. Wong, Lorenzo Alvisi:
What's a little collusion between friends? 240-249 - Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas:
A distributed algorithm for gathering many fat mobile robots in the plane. 250-259 - Ji Zhu, Stratis Ioannidis, Nidhi Hegde, Laurent Massoulié:
Stable and scalable universal swarms. 260-269
Byzantine agreement and self-stabilization
- Danny Dolev, Christoph Lenzen:
Early-deciding consensus is expensive. 270-279 - Allison B. Lewko, Mark Lewko:
On the complexity of asynchronous agreement against powerful adversaries. 280-289 - Swan Dubois, Rachid Guerraoui:
Introducing speculation in self-stabilization: an application to mutual exclusion. 290-298
Shared and transactional memory
- Hillel Avni, Nir Shavit, Adi Suissa:
Leaplist: lessons learned in designing tm-supported range queries. 299-308 - Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
A programming language perspective on transactional memory consistency. 309-318 - Michael Gorelik, Danny Hendler:
Brief announcement: an asymmetric flat-combining based queue algorithm. 319-321 - Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel:
Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. 322-324
Radio and wireless networks
- Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized broadcast in radio networks with collision detection. 325-334 - Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Maximal independent sets in multichannel radio networks. 335-344 - Mohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport:
The cost of radio network broadcast for different models of unreliable links. 345-354 - Marijke H. L. Bodlaender, Magnús M. Halldórsson, Pradipta Mitra:
Connectivity and aggregation in multihop wireless networks. 355-364
Sensor network, graph algorithms and system security
- Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. 365-374 - Christoph Lenzen, David Peleg:
Efficient distributed source detection with limited bandwidth. 375-382 - Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Distributed algorithms for barrier coverage using relocatable sensors. 383-392 - Gang Xu, George T. Amariucai, Yong Guan:
Delegation of computation with verification outsourcing: curious verifiers. 393-402 - Calvin C. Newport:
Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks. 403-405 - Wojciech Wawrzyniak:
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks. 406-408
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-01-24 17:03 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:
