Petr Kuznetsov

Comput. Commun. Rev., 2016

In the Search for Optimal Concurrency.

[BibT_eX]

[DOI]

Vincent Gramoli

Proceedings of the Structural Information and Communication Complexity, 2016

Read-Write Memory and k-Set Consensus as an Affine Task.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Set-Consensus Collections are Decidable.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015

Wait-freedom with advice.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Why Transactional Memory Should Not Be Obstruction-Free.

[BibT_eX]

[DOI]

CoRR, 2015

A Concurrency-Optimal List-Based Set.

[BibT_eX]

[DOI]

CoRR, 2015

On the Space Complexity of Set Agreement.

[BibT_eX]

[DOI]

Eric Ruppert

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Progressive Transactional Memory in Time and Space.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

On the Uncontended Complexity of Anonymous Consensus.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

A distributed and robust SDN control plane for transactional network updates.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

On Partial Wait-Freedom in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Safety and Deferred Update in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014

Live Equals Fast in Iterated Models.

[BibT_eX]

[DOI]

Zohir Bouzid

CoRR, 2014

A generalized asynchronous computability theorem.

[BibT_eX]

[DOI]

Ciprian Manolescu

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Strong Equivalence Relations for Iterated Models.

[BibT_eX]

[DOI]

Zohir Bouzid

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Simple CHT: A New Derivation of the Weakest Failure Detector for Consensus.

[BibT_eX]

[DOI]

CoRR, 2013

A Distributed SDN Control Plane for Consistent Policy Updates.

[BibT_eX]

[DOI]

CoRR, 2013

Universal Model Simulation: BG and Extended BG as Examples.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Software transactional networking: concurrent and consistent policy composition.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, 2013

Safety of Deferred Update in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012

WTTM 2011: the third workshop on the theory of transactional memory.

[BibT_eX]

[DOI]

SIGACT News, 2012

The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Understanding Non-Uniform Failure Models.

[BibT_eX]

[DOI]

Bull. EATCS, 2012

Renaming and the weakest family of failure detectors.

[BibT_eX]

[DOI]

Yehuda Afek

Israel Nir

Distributed Comput., 2012

On Non-Interference of Transactions

[BibT_eX]

[DOI]

Sathya Peri

CoRR, 2012

From Sequential to Concurrent: Correctness and Relative Efficiency

[BibT_eX]

[DOI]

Vincent Gramoli

CoRR, 2012

On the cost of composing shared-memory algorithms.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Brief announcement: From sequential to concurrent: correctness and relative efficiency.

[BibT_eX]

[DOI]

Vincent Gramoli

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011

The impossibility of boosting distributed service resilience.

[BibT_eX]

[DOI]

Inf. Comput., 2011

On set consensus numbers.

[BibT_eX]

[DOI]

Distributed Comput., 2011

The failure detector abstraction.

[BibT_eX]

[DOI]

Felix C. Freiling

ACM Comput. Surv., 2011

Impersonal Failure Detection

[BibT_eX]

[DOI]

CoRR, 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Autonomous Storage Management for Personal Devices with PodBase.

[BibT_eX]

[DOI]

Proceedings of the 2011 USENIX Annual Technical Conference, 2011

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

On the Cost of Concurrency in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Relating <i>L</i>\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

L-Resilient Adversaries and Hitting Sets

[BibT_eX]

[DOI]

CoRR, 2010

Towards Network Games with Social Preferences.

[BibT_eX]

[DOI]

Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2010

Brief announcement: on L-resilience, hitting sets, and colorless tasks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

BFTW<sup>3</sup>: why? when? where? workshop on the theory and practice of byzantine fault tolerance.

[BibT_eX]

[DOI]

Rodrigo Rodrigues

SIGACT News, 2009

The complexity of obstruction-free implementations.

[BibT_eX]

[DOI]

J. ACM, 2009

On the weakest failure detector ever.

[BibT_eX]

[DOI]

Distributed Comput., 2009

The weakest failure detector for solving k-set agreement.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The Fault Detection Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Zeno: Eventually Consistent Byzantine-Fault Tolerance.

[BibT_eX]

[DOI]

Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009

2008

The gap in circumventing the impossibility of consensus.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

The weakest failure detectors to boost obstruction-freedom.

[BibT_eX]

[DOI]

Michal Kapalka

Distributed Comput., 2008

Failure detectors as type boosters.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Defining weakly consistent Byzantine fault-tolerant services.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, 2008

PodBase: transparent storage management for personal devices.

[BibT_eX]

[DOI]

Ansley Post

Proceedings of the 7th international conference on Peer-to-peer systems, 2008

2007

PeerReview: practical accountability for distributed systems.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007, 2007

N-Consensus is the Second Strongest Object for N+1 Processes.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Synchronizing without locks is inherently expensive.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Case for Byzantine Fault Detection.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Hot Topics in System Dependability, 2006

Abstracting out Byzantine Behavior.

[BibT_eX]

[DOI]

Proceedings of the From Security to Dependability, 10.09. - 15.09.2006, 2006

2005

Mutual exclusion in asynchronous systems with failure detectors.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2005

Computing with Reads and Writes in the Absence of Step Contention.

[BibT_eX]

[DOI]

Hagit Attiya

Proceedings of the Distributed Computing, 19th International Conference, 2005

2004

The weakest failure detectors to solve certain fundamental problems in distributed computing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

D-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability.

[BibT_eX]

[DOI]

Patrick Th. Eugster

Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

2003

Lightweight probabilistic broadcast.

[BibT_eX]

[DOI]

Patrick Th. Eugster

Sidath B. Handurukande

Anne-Marie Kermarrec

ACM Trans. Comput. Syst., 2003

On Failure Detectors and Type Boosters.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

2002

A Note on Set Agreement with Omission Failures.

[BibT_eX]

[DOI]

Bastian Pochon

Proceedings of the 4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, 2002

On the Weakest Failure Detector for Non-Blocking Atomic Commit.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

Reducing Noise in Gossip-Based Reliable Broadcast.

[BibT_eX]

[DOI]