| Publication | Date of Publication | Type |
|---|
| The Kronecker product and local computations in graphs | 2023-02-23 | Paper |
| Definitions and comparisons of local computations on graphs | 2022-08-18 | Paper |
| Counting in one-hop beeping networks | 2019-06-06 | Paper |
| Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds | 2019-05-07 | Paper |
| Computing the closure of sets of words under partial commutations | 2019-01-10 | Paper |
| Design patterns in beeping algorithms: examples, emulation, and analysis | 2018-12-21 | Paper |
| Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) | 2018-08-16 | Paper |
| Design Patterns in Beeping Algorithms. | 2018-07-18 | Paper |
| Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds | 2016-11-18 | Paper |
| Some remarks on the Kronecker product of graphs | 2016-06-09 | Paper |
| A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots | 2016-03-10 | Paper |
| Analysis of fully distributed splitting and naming probabilistic procedures and applications | 2015-05-22 | Paper |
| On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms | 2015-01-13 | Paper |
| On the time and the bit complexity of distributed randomised anonymous ring colouring | 2014-01-10 | Paper |
| Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings | 2014-01-10 | Paper |
| Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications | 2013-12-17 | Paper |
| Graph Relabelling Systems | 2013-05-24 | Paper |
| Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. | 2013-05-10 | Paper |
| Election in partially anonymous networks with arbitrary knowledge in message passing systems | 2013-02-04 | Paper |
| Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks | 2012-10-31 | Paper |
| An optimal bit complexity randomized distributed MIS algorithm | 2012-02-06 | Paper |
| On the power of synchronization between two adjacent processes | 2012-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077352 | 2011-02-22 | Paper |
| About randomised distributed graph colouring and graph partition algorithms | 2010-10-22 | Paper |
| Local Terminations and Distributed Computability in Anonymous Networks | 2008-11-20 | Paper |
| Labelled (Hyper)Graphs, Negotiations and the Naming Problem | 2008-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504346 | 2008-06-11 | Paper |
| About the Termination Detection in the Asynchronous Message Passing Model | 2008-03-07 | Paper |
| Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks | 2008-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431920 | 2008-01-02 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Graph Transformations | 2007-06-21 | Paper |
| Graph Transformations | 2007-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416074 | 2007-01-19 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Locally guided randomized elections in trees: The totally fair case | 2005-05-04 | Paper |
| Deducible and equivalent structural knowledges in distributed algorithms | 2005-02-11 | Paper |
| Characterizations of classes of graphs recognizable by local computations | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738224 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4438773 | 2003-12-10 | Paper |
| Analysis of a randomized rendezvous algorithm | 2003-07-29 | Paper |
| Randomized local elections. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524581 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502806 | 2000-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954453 | 2000-06-07 | Paper |
| Checking Global Graph Properties by Means of Local Computations: the Majority Problem | 1998-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342905 | 1997-06-24 | Paper |
| Medians and centres of polyominoes | 1997-02-27 | Paper |
| On the recognition of families of graphs with local computations | 1995-12-13 | Paper |
| New results on the star problem in trace monoids | 1995-08-02 | Paper |
| Different local controls for graph relabeling systems | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273662 | 1994-10-31 | Paper |
| Coverings and minors: Application to local computations in graphs | 1994-04-21 | Paper |
| Asynchronous mappings and asynchronous cellular automata | 1994-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281656 | 1994-04-07 | Paper |
| Computing with graph rewriting systems with priorities | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694746 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037327 | 1993-05-18 | Paper |
| ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS | 1992-09-27 | Paper |
| On recognizable subsets of free partially commutative monoids | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804201 | 1988-01-01 | Paper |
| On lexicographic semi-commutations | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783583 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725561 | 1986-01-01 | Paper |
| Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif | 1986-01-01 | Paper |
| Recognizable subsets of some partially Abelian monoids | 1985-01-01 | Paper |
| Calcul de longueurs de chaînes de réécriture dans le monoïde libre | 1985-01-01 | Paper |
| About the rewriting systems produced by the Knuth-Bendix completion algorithm | 1983-01-01 | Paper |
