PODC A*

55 papers

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