| Publication | Date of Publication | Type |
|---|
Back to the coordinated attack problem
Mathematical Structures in Computer Science | 2021-08-16 | Paper |
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Leader-based de-anonymization of an anonymous read/write memory
Theoretical Computer Science | 2020-08-25 | Paper |
| Anonymous Read/write memory: leader election and de-anonymization | 2020-03-03 | Paper |
Snap-stabilizing tasks in anonymous networks
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Snap-stabilizing tasks in anonymous networks
Theory of Computing Systems | 2019-06-21 | Paper |
Anonymous graph exploration with binoculars
(available as arXiv preprint) | 2018-08-24 | Paper |
| \(k\)-set agreement in communication networks with omission faults | 2018-07-18 | Paper |
On the expressivity of time-varying graphs
Theoretical Computer Science | 2015-06-10 | Paper |
A characterization of oblivious message adversaries for which consensus is solvable
Theoretical Computer Science | 2015-05-22 | Paper |
Brief announcement: Waiting in dynamic networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
What do we need to know to elect in networks with unknown participants?
Structural Information and Communication Complexity | 2014-08-07 | Paper |
A characterization of dynamic networks where consensus is solvable
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Expressivity of Time-Varying Graphs
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Distributed Computing | 2013-02-04 | Paper |
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
Algorithmica | 2012-04-26 | Paper |
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
Structural Information and Communication Complexity | 2011-08-19 | Paper |
Acyclic and \(k\)-distance coloring of the grid
Information Processing Letters | 2009-04-28 | Paper |
Local Terminations and Distributed Computability in Anonymous Networks
Lecture Notes in Computer Science | 2008-11-20 | Paper |
About the Termination Detection in the Asynchronous Message Passing Model
Lecture Notes in Computer Science | 2008-03-07 | Paper |
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Deducible and equivalent structural knowledges in distributed algorithms
Theory of Computing Systems | 2005-02-11 | Paper |
Characterizations of classes of graphs recognizable by local computations
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2087429 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2016070 (Why is no real title available?) | 2003-12-10 | Paper |
Minimum feedback vertex set and acyclic coloring.
Information Processing Letters | 2003-01-21 | Paper |
A self-stabilizing enumeration algorithm.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1504828 (Why is no real title available?) | 2000-09-12 | Paper |
