default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd PODC 2014: Paris, France
- Magnús M. Halldórsson, Shlomi Dolev:
ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014. ACM 2014, ISBN 978-1-4503-2944-6
Keynote lecture
- Silvio Micali:
Rational and resilient protocols. 1
Session 1
- Achour Mostéfaoui, Moumen Hamouma
, Michel Raynal:
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages. 2-9 - Michael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate:
Asynchronous MPC with a strict honest majority using non-equivocation. 10-19 - Jonathan Katz, Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas:
Distributing the setup in universally composable multi-party computation. 20-29
Session 2
- Alex Kogan, Maurice Herlihy:
The future(s) of shared data structures. 30-39 - Rachid Guerraoui, Eric Ruppert:
A paradox of eventual linearizability in shared memory. 40-49 - Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Brief announcement: are lock-free concurrent algorithms practically wait-free? 50-52 - Joseph Izraelevitz, Michael L. Scott:
Brief announcement: a generic construction for nonblocking dual containers. 53-55
Session 3
- Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-message broadcast with abstract MAC layers and unreliable links. 56-65 - Calvin C. Newport:
Consensus with an abstract MAC layer. 66-75 - Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. 76-85 - Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-delta lower bounds in the LOCAL model. 86-95
Session 4
- Yuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer:
Anonymous networks: randomization = 2-hop coloring. 96-105 - Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Beyond set disjointness: the communication complexity of finding the intersection. 106-113 - Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. 114-123
Session 5
- Edith Cohen:
Estimation for monotone sampling: competitiveness and customization. 124-133 - Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. 134-143 - Matteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schröder:
Brief announcement: towards security and privacy for outsourced data in the multi-party setting. 144-146 - Messaoud Doudou, José M. Barceló-Ordinas, Djamel Djenouri, Jorge García-Vidal, Nadjib Badache:
Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks. 147-152
Keynote lecture
- Michael George Luby:
Coding theory for scalable media delivery. 153-155
Session 6
- Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed connectivity decomposition. 156-165 - Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Can quantum communication speed up distributed computation? 166-175 - Bernhard Haeupler, Dahlia Malkhi:
Optimal gossip with direct addressing. 176-185
Session 7
- Danny Hendler, Vitaly Khait:
Complexity tradeoffs for read and update operations. 186-195 - Maya Arbel, Hagit Attiya:
Concurrent updates with RCU: search tree as an example. 196-205 - Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. 206-208 - Nir Hemed, Noam Rinetzky:
Brief announcement: concurrency-aware linearizability. 209-211
Session 8
- Yehuda Afek, Amir Levy, Adam Morrison:
Software-improved hardware lock elision. 212-221 - Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. 222-231 - Dan Alistarh, Oksana Denysyuk, Luís E. T. Rodrigues, Nir Shavit:
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems. 232-241 - Yujie Liu, Kunlong Zhang, Michael F. Spear:
Dynamic-sized nonblocking hash tables. 242-251
Session 9
- Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva:
Trade-offs between selection complexity and performance when searching the plane without communication. 252-261 - Christoph Lenzen, Boaz Patt-Shamir:
Improved distributed steiner forest construction. 262-271 - Michael Kapralov, David P. Woodruff:
Spanners and sparsifiers in dynamic streams. 272-281 - Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. 282-290
2013 ACM A.M. turing award lecture
- Leslie Lamport:
An incomplete history of concurrency chapter 1. 1965-1977. 291
Keynote lecture
- Joseph Sifakis:
Rigorous system design. 292
Session 10
- Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
How to withstand mobile virus attacks, revisited. 293-302 - Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. 303-312 - Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov:
Fast and unconditionally secure anonymous channel. 313-321
Session 11
- Bapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas:
Efficient lock-free binary search trees. 322-331 - Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert:
The amortized complexity of non-blocking binary search trees. 332-340 - Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson:
Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. 341-343 - Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Brief announcement: local approximability of minimum dominating set on planar graphs. 344-346
Session 12
- Marijke H. L. Bodlaender, Magnús M. Halldórsson:
Beyond geometry: towards fully realistic wireless models. 347-356 - Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
On the impact of geometry on ad hoc communication in wireless networks. 357-366 - Andrew Drucker, Fabian Kuhn, Rotem Oshman:
On the power of the congested clique model. 367-376 - Juhana Laurinharju, Jukka Suomela:
Brief announcement: linial's lower bound made easy. 377-378 - Tushar Bisht, Kishore Kothapalli, Sriram V. Pemmaraju:
Brief announcement: Super-fast t-ruling sets. 379-381 - Danupon Nanongkai:
Brief announcement: almost-tight approximation distributed algorithm for minimum cut. 382-384
Session 13
- Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel:
Making objects writable. 385-395 - Lewis Tseng, Nitin H. Vaidya:
Asynchronous convex hull consensus in the presence of crash faults. 396-405 - Yehuda Afek, Yehonatan Ginzberg, Shir Landau Feibish, Moshe Sulamy:
Distributed computing building blocks for rational agents. 406-415 - Yuda Zhao, Haifeng Yu, Binbin Chen:
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions. 416-426
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-05-05 00:34 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:
