Armando Castañeda

Miguel Piña

J. Parallel Distributed Comput., April, 2024

Strong Linearizability using Primitives with Consensus Number 2.

[BibT_eX]

[DOI]

Constantin Enea

CoRR, 2024

2023

Communication Pattern Logic: Epistemic and Topological Views.

[BibT_eX]

[DOI]

J. Philos. Log., October, 2023

Locally solvable tasks and the limitations of valency arguments.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., June, 2023

Tasks in modular proofs of concurrent algorithms.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Synchronous <i>t</i>-resilient consensus in arbitrary graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity.

[BibT_eX]

[DOI]

Distributed Comput., June, 2023

Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

Comparing the Update Expressivity of Communication Patterns and Action Models.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

A Linearizability-based Hierarchy for Concurrent Specifications.

[BibT_eX]

[DOI]

Commun. ACM, 2023

Topological Characterization of Task Solvability in General Models of Computation.

[BibT_eX]

[DOI]

Thomas Nowak

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability.

[BibT_eX]

[DOI]

Gilde Valeria Rodríguez

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

2022

Separating lock-freedom from wait-freedom at every level of the consensus hierarchy.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2022

Unbeatable consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Modular Baskets Queue.

[BibT_eX]

[DOI]

Miguel Piña

CoRR, 2022

A Snapshot-Based Introduction to the Linearizability Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 10th International Conference, 2022

2021

A topological perspective on distributed network algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems.

[BibT_eX]

[DOI]

Diego A. Velázquez

David A. Rosenblueth

Proceedings of the Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2021

Fully Read/Write Fence-Free Work-Stealing with Multiplicity.

[BibT_eX]

[DOI]

Miguel Piña

Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020

What Can Be Done with Consensus Number One: Relaxed Queues and Stacks.

[BibT_eX]

[DOI]

CoRR, 2020

K-set agreement bounds in round-based models through combinatorial topology.

[BibT_eX]

[DOI]

Adam Shimi

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Relaxed Queues and Stacks from Read/Write Operations.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Fully Compact Routing in Low Memory Self-Healing Trees.

[BibT_eX]

[DOI]

Jonas Lefèvre

Amitabh Trehan

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Bounds on the Step and Namespace Complexity of Renaming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Making Local Algorithms Wait-Free: the Case of Ring Coloring.

[BibT_eX]

[DOI]

Carole Delporte-Gallet

Hugues Fauconnier

Theory Comput. Syst., 2019

The topology of look-compute-move robot wait-free algorithms with hard termination.

[BibT_eX]

[DOI]

Manuel Alcantara

David Flores-Peñaloza

Distributed Comput., 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.

[BibT_eX]

[DOI]

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

2018

Compact routing messages in self-healing trees.

[BibT_eX]

[DOI]

Danny Dolev

Amitabh Trehan

Theor. Comput. Sci., 2018

Nontrivial and universal helping for wait-free queues and stacks.

[BibT_eX]

[DOI]

Danny Hendler

J. Parallel Distributed Comput., 2018

Convergence and covering on graphs for wait-free robots.

[BibT_eX]

[DOI]

Matthieu Roy

J. Braz. Comput. Soc., 2018

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability.

[BibT_eX]

[DOI]

J. ACM, 2018

Self-healing Routing and Other Problems in Compact Memory.

[BibT_eX]

[DOI]

Jonas Lefèvre

Amitabh Trehan

CoRR, 2018

Separating Lock-Freedom from Wait-Freedom.

[BibT_eX]

[DOI]

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

2017

Long-Lived Tasks.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 5th International Conference, 2017

Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 5th International Conference, 2017

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Manuel Alcantara

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Asynchronous Coordination Under Preferences and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Unbeatable Set Consensus via Topological and Combinatorial Reasoning.

[BibT_eX]

[DOI]

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

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.

[BibT_eX]

[DOI]

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

Two Convergence Problems for Robots on Graphs.

[BibT_eX]

[DOI]

Matthieu Roy

Proceedings of the 2016 Seventh Latin-American Symposium on Dependable Computing, 2016

2015

Specifying Concurrent Problems: Beyond Linearizability.

[BibT_eX]

[DOI]

CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014

An Equivariance Theorem with Applications to Renaming.

[BibT_eX]

[DOI]

Maurice Herlihy

Algorithmica, 2014

2013

A non-topological proof for the impossibility of k-set agreement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus.

[BibT_eX]

[DOI]

CoRR, 2013

Brief announcement: pareto optimal solutions to consensus and set consensus.

[BibT_eX]

[DOI]

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

Upper bound on the complexity of solving hard renaming.

[BibT_eX]

[DOI]

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

On the Consensus Number of Non-adaptive Perfect Renaming.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - First International Conference, 2013

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012

New combinatorial topology bounds for renaming: The upper bound.

[BibT_eX]

[DOI]

J. ACM, 2012

Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.

[BibT_eX]

[DOI]

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

When and How Process Groups Can Be Used to Reduce the Renaming Space.

[BibT_eX]

[DOI]

Julien Stainer

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

The renaming problem in shared memory systems: An introduction.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2011

An Equivariance Theorem with Applications to Renaming (Preliminary Version)

[BibT_eX]

[DOI]

Maurice Herlihy

CoRR, 2011

2010

An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

New combinatorial topology bounds for renaming: the lower bound.

[BibT_eX]

[DOI]

Distributed Comput., 2010

2008

A review of PODC 2008.

[BibT_eX]

[DOI]

SIGACT News, 2008

New combinatorial topology upper and lower bounds for renaming.

[BibT_eX]

[DOI]