default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st PODC 2012: Funchal, Madeira, Portugal
- Darek Kowalski, Alessandro Panconesi:
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
- James Aspnes:
Faster randomized consensus with an oblivious adversary. 1-8 - Victor Bushkov, Rachid Guerraoui
, Michal Kapalka:
On the liveness of transactional memory. 9-18 - George Giakkoupis, Philipp Woelfel:
On the time and space complexity of randomized test-and-set. 19-28
Information spreading, random walks
- Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. 29-36 - Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. 37-46 - Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. 47-56
Communication complexity
- Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons:
The cost of fault tolerance in multi-party communication complexity. 57-66 - Andrew Drucker, Fabian Kuhn, Rotem Oshman:
The communication complexity of distributed task allocation. 67-76 - Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni:
Collaborative search on the plane without communication. 77-86
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 V. 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. Faleiro, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani:
Generalized lattice agreement. 125-134
Game theory and security
- Clemens P. J. Adolphs, Petra Berenbrink:
Distributed selfish load balancing with weights and speeds. 135-144 - Seth Gilbert, Maxwell Young:
Making evildoers pay: resource-competitive broadcast in sensor networks. 145-154 - Adi Akavia, Shafi Goldwasser, Carmit Hazay:
Distributed public key schemes secure against continual leakage. 155-164
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
- Alejandro Cornejo, Seth Gilbert, Calvin C. Newport:
Aggregation in dynamic networks. 195-204 - Magnús M. Halldórsson, Pradipta Mitra:
Distributed connectivity of wireless networks. 205-214 - Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Leader election in shared spectrum radio networks. 215-224
Brief announcements
- Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
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 E. T. 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
- Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry:
Asynchronous failure detectors. 243-252 - Maurice Herlihy, Sergio Rajsbaum:
Simulations and reductions for colorless tasks. 253-260 - Gadi Taubenfeld:
A closer look at fault tolerance. 261-270
Load balancing and scheduling
- Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. 271-280 - Thomas Kesselheim:
Dynamic packet scheduling in wireless networks. 281-290 - Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang:
Competitive and fair throughput for co-existing networks under adversarial interference. 291-300
Byzantine agreements
- Allen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues:
On the (limited) power of non-equivocation. 301-308 - Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen:
On the price of equivocation in byzantine agreement. 309-318 - Guanfeng Liang, Nitin H. Vaidya:
Byzantine broadcast in point-to-point networks using local linear coding. 319-328
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 Valur 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
- Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed algorithms for scheduling on line and tree networks. 345-354 - Stephan Holzer, Roger Wattenhofer:
Optimal distributed all pairs shortest paths and applications. 355-364 - Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang:
Iterative approximate byzantine consensus in arbitrary directed graphs. 365-374
15 shared memory II
- James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. 375-384 - Maryam Helmi, Lisa Higham, Philipp Woelfel:
Strongly linearizable implementations: possibilities and impossibilities. 385-394
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-06-04 20:59 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:
