PODC A*

62 papers

YearTitle / Authors
2012A closer look at fault tolerance.
Gadi Taubenfeld
2012A simple approach for adapting continuous load balancing processes to discrete settings.
Hoda Akbari, Petra Berenbrink, Thomas Sauerwald
2012ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012
Darek Kowalski, Alessandro Panconesi
2012Aggregation in dynamic networks.
Alejandro Cornejo, Seth Gilbert, Calvin C. Newport
2012Asynchronous failure detectors.
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
2012Brief announcement: From sequential to concurrent: correctness and relative efficiency.
Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2012Brief announcement: a calculus of policy-based routing systems.
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov
2012Brief announcement: a tight RMR lower bound for randomized mutual exclusion.
George Giakkoupis, Philipp Woelfel
2012Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics.
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2012Brief announcement: all-to-all gradecast using coding with byzantine failures.
John Bridgman, Vijay K. Garg
2012Brief announcement: an obstacle to scalability in wireless networks.
András Faragó
2012Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.
Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia
2012Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers.
Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman
2012Brief announcement: delay or deliver dilemma in organization networks.
Shailesh Vaya
2012Brief announcement: distributed algorithms for throughput performance in wireless networks.
Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012Brief announcement: distributed cryptography using trinc.
Michael Backes, Fabian Bendun, Aniket Kate
2012Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors.
Nuno M. Preguiça, Carlos Baquero, Paulo Sérgio Almeida, Victor Fonte, Ricardo Gonçalves
2012Brief announcement: efficient optimally resilient statistical AVSS and its applications.
Ashish Choudhury, Arpita Patra
2012Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors.
Michel Raynal, Julien Stainer
2012Brief announcement: live streaming with utilities, quality and cost.
Ymir Vigfusson, Ken Birman, Daniel A. Freedman, Qi Huang, Kristján Valur Jónsson, Gunnar Sigurbjörnsson
2012Brief announcement: maintaining large dense subgraphs on dynamic networks.
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan
2012Brief announcement: network formation games can give rise to realistic networks.
András Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó
2012Brief announcement: network-destabilizing attacks.
Robert Lychev, Sharon Goldberg, Michael Schapira
2012Brief announcement: on the resilience of routing tables.
Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla
2012Brief announcement: optimal amortized secret sharing with cheater identification.
Ashish Choudhury
2012Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults.
Oksana Denysyuk, Luís E. T. Rodrigues
2012Brief announcement: reconfigurable state machine replication from non-reconfigurable building blocks.
Vita Bortnikov, Gregory V. Chockler, Dmitri Perelman, Alexey Roytman, Shlomit Shachor, Ilya Shnayderman
2012Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2012Brief announcement: tolerating permanent and transient value faults.
Zarko Milosevic, Martin Hutle, André Schiper
2012Brief announcement: waiting in dynamic networks.
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2012Brief announcement: what can be computed without communication?
Heger Arfaoui, Pierre Fraigniaud
2012Byzantine broadcast in point-to-point networks using local linear coding.
Guanfeng Liang, Nitin H. Vaidya
2012Coalescing random walks and voting on graphs.
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012Collaborative search on the plane without communication.
Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
2012Competitive and fair throughput for co-existing networks under adversarial interference.
Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
2012Distributed algorithms for scheduling on line and tree networks.
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal
2012Distributed connectivity of wireless networks.
Magnús M. Halldórsson, Pradipta Mitra
2012Distributed maximal matching: greedy is optimal.
Juho Hirvonen, Jukka Suomela
2012Distributed public key schemes secure against continual leakage.
Adi Akavia, Shafi Goldwasser, Carmit Hazay
2012Distributed selfish load balancing with weights and speeds.
Clemens P. J. Adolphs, Petra Berenbrink
2012Dynamic packet scheduling in wireless networks.
Thomas Kesselheim
2012Faster randomized consensus with an oblivious adversary.
James Aspnes
2012Faster than optimal snapshots (for a while): preliminary version.
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2012Generalized lattice agreement.
Jose M. Faleiro, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani
2012Information spreading in dynamic graphs.
Andrea Clementi, Riccardo Silvestri, Luca Trevisan
2012Iterative approximate byzantine consensus in arbitrary directed graphs.
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
2012Leader election in shared spectrum radio networks.
Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport
2012Lower bounds for local approximation.
Mika Göös, Juho Hirvonen, Jukka Suomela
2012Making evildoers pay: resource-competitive broadcast in sensor networks.
Seth Gilbert, Maxwell Young
2012On the (limited) power of non-equivocation.
Allen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues
2012On the liveness of transactional memory.
Victor Bushkov, Rachid Guerraoui, Michal Kapalka
2012On the price of equivocation in byzantine agreement.
Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen
2012On the time and space complexity of randomized test-and-set.
George Giakkoupis, Philipp Woelfel
2012Optimal distributed all pairs shortest paths and applications.
Stephan Holzer, Roger Wattenhofer
2012Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time.
Petra Berenbrink, Colin Cooper, Tom Friedetzky
2012Simulations and reductions for colorless tasks.
Maurice Herlihy, Sergio Rajsbaum
2012Strongly linearizable implementations: possibilities and impossibilities.
Maryam Helmi, Lisa Higham, Philipp Woelfel
2012The communication complexity of distributed task allocation.
Andrew Drucker, Fabian Kuhn, Rotem Oshman
2012The cost of fault tolerance in multi-party communication complexity.
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons
2012Universal constructions that ensure disjoint-access parallelism and wait-freedom.
Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2012Wait-freedom with advice.
Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov
2012Weak models of distributed computing, with connections to modal logic.
Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema