| Publication | Date of Publication | Type |
|---|
| Locally solvable tasks and the limitations of valency arguments | 2026-03-31 | Paper |
| Relaxed queues and stacks from read/write operations | 2026-03-31 | Paper |
| Communication pattern models: an extension of action models for dynamic-network distributed systems | 2024-11-24 | Paper |
| Synchronous \(t\)-resilient consensus in arbitrary graphs | 2024-04-19 | Paper |
| Tasks in modular proofs of concurrent algorithms | 2024-04-19 | Paper |
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Comparing the Update Expressivity of Communication Patterns and Action Models
Electronic Proceedings in Theoretical Computer Science | 2024-02-28 | Paper |
scientific article; zbMATH DE number 7774267 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
Communication pattern logic: epistemic and topological views
Journal of Philosophical Logic | 2023-10-24 | Paper |
Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
Distributed Computing | 2023-06-19 | Paper |
Tasks in modular proofs of concurrent algorithms
Information and Computation | 2023-05-19 | Paper |
Synchronous \(t\)-resilient consensus in arbitrary graphs
Information and Computation | 2023-05-19 | Paper |
Unbeatable consensus
Distributed Computing | 2022-04-01 | Paper |
K-set agreement bounds in round-based models through combinatorial topology
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A topological perspective on distributed network algorithms
Theoretical Computer Science | 2020-12-15 | Paper |
A topological perspective on distributed network algorithms
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Making local algorithms wait-free: the case of ring coloring
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Separating Lock-Freedom from Wait-Freedom
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
The topology of look-compute-move robot wait-free algorithms with hard termination
Distributed Computing | 2019-07-11 | Paper |
Making local algorithms wait-free: the case of ring coloring
Theory of Computing Systems | 2019-06-21 | Paper |
Unifying Concurrent Objects and Distributed Tasks
Journal of the ACM | 2019-02-25 | Paper |
Bounds on the step and namespace complexity of renaming
SIAM Journal on Computing | 2019-01-14 | Paper |
| Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) | 2018-08-24 | Paper |
Compact routing messages in self-healing trees
Theoretical Computer Science | 2017-12-20 | Paper |
Compact routing messages in self-healing trees
Theoretical Computer Science | 2017-12-20 | Paper |
Unbeatable set consensus via topological and combinatorial reasoning
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Nontrivial and universal helping for wait-free queues and stacks | 2017-09-29 | Paper |
Brief announcement: Asynchronous coordination with constraints and preferences
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Asynchronous coordination under preferences and constraints
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Generalized symmetry breaking tasks and nondeterminism in concurrent objects
SIAM Journal on Computing | 2016-04-25 | Paper |
An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
Electronic Notes in Theoretical Computer Science | 2015-03-18 | Paper |
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
An equivariance theorem with applications to renaming
Algorithmica | 2015-01-19 | Paper |
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
The renaming problem in shared memory systems: an introduction
Computer Science Review | 2014-10-24 | Paper |
New combinatorial topology bounds for renaming: the upper bound
Journal of the ACM | 2014-02-17 | Paper |
A non-topological proof for the impossibility of \(k\)-set agreement
Theoretical Computer Science | 2014-01-13 | Paper |
An equivariance theorem with applications to renaming
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
New combinatorial topology bounds for renaming: the lower bound
Distributed Computing | 2010-09-09 | Paper |
