31. PODC 2012:
Funchal, Madeira, Portugal
Darek Kowalski, Alessandro Panconesi (Eds.):
ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012.
ACM 2012, ISBN 978-1-4503-1450-3 
Shared memory I
Information spreading, random walks
Communication complexity
Brief announcements
- Heger Arfaoui, Pierre Fraigniaud:
Brief announcement: what can be computed without communication?
87-88
- Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Brief announcement: distributed algorithms for throughput performance in wireless networks.
89-90
- Michael Backes, Fabian Bendun, Aniket Kate:
Brief announcement: distributed cryptography using trinc.
91-92
- Vita Bortnikov, Gregory Chockler, Dmitri Perelman, Alexey Roytman, Shlomit Shachor, Ilya Shnayderman:
Brief announcement: reconfigurable state machine replication from non-reconfigurable building blocks.
93-94
- John Bridgman, Vijay K. Garg:
Brief announcement: all-to-all gradecast using coding with byzantine failures.
95-96
- Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.
97-98
- Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks.
99-100
- Ashish Choudhury:
Brief announcement: optimal amortized secret sharing with cheater identification.
101-102
- Ashish Choudhury, Arpita Patra:
Brief announcement: efficient optimally resilient statistical AVSS and its applications.
103-104
Wait freedom
- Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice.
105-114
- Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom.
115-124
- Jose M. Falerio, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani:
Generalized lattice agreement.
125-134
Game theory and security
Locality
- Juho Hirvonen, Jukka Suomela:
Distributed maximal matching: greedy is optimal.
165-174
- Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation.
175-184
- Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic.
185-194
Ad-hoc networks
Brief announcements
- Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Angel Sanchez:
Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics.
225-226
- Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia:
Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.
227-228
- Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks.
229-230
- Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers.
231-232
- Oksana Denysyuk, Luís Rodrigues:
Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults.
233-234
- András Faragó:
Brief announcement: an obstacle to scalability in wireless networks.
235-236
- Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla:
Brief announcement: on the resilience of routing tables.
237-238
- George Giakkoupis, Philipp Woelfel:
Brief announcement: a tight RMR lower bound for randomized mutual exclusion.
239-240
- Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
Brief announcement: From sequential to concurrent: correctness and relative efficiency.
241-242
Fault tolerance
Load balancing and scheduling
Byzantine agreements
Brief announcements
- András Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó:
Brief announcement: network formation games can give rise to realistic networks.
329-330
- Robert Lychev, Sharon Goldberg, Michael Schapira:
Brief announcement: network-destabilizing attacks.
331-332
- Zarko Milosevic, Martin Hutle, André Schiper:
Brief announcement: tolerating permanent and transient value faults.
333-334
- Nuno M. Preguiça, Carlos Baquero, Paulo Sérgio Almeida, Victor Fonte, Ricardo Gonçalves:
Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors.
335-336
- Michel Raynal, Julien Stainer:
Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors.
337-338
- Shailesh Vaya:
Brief announcement: delay or deliver dilemma in organization networks.
339-340
- Ymir Vigfusson, Ken Birman, Daniel A. Freedman, Qi Huang, Kristján V. Jónsson, Gunnar Sigurbjörnsson:
Brief announcement: live streaming with utilities, quality and cost.
341-342
- Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov:
Brief announcement: a calculus of policy-based routing systems.
343-344
Distributed graph algorithms
15 shared memory II
Last update Sun May 19 23:27:37 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
