| Publication | Date of Publication | Type |
|---|
The Kronecker product and local computations in graphs
Trees in Algebra and Programming — CAAP '96 | 2023-02-23 | Paper |
Definitions and comparisons of local computations on graphs (extended abstract)
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Counting in one-hop beeping networks
Theoretical Computer Science | 2019-06-06 | Paper |
Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
Algorithmica | 2019-05-07 | Paper |
Computing the closure of sets of words under partial commutations
Automata, Languages and Programming | 2019-01-10 | Paper |
Design patterns in beeping algorithms: examples, emulation, and analysis
Information and Computation | 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
Information and Computation | 2016-11-18 | Paper |
Some remarks on the Kronecker product of graphs
Information Processing Letters | 2016-06-09 | Paper |
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
Information and Computation | 2016-03-10 | Paper |
Analysis of fully distributed splitting and naming probabilistic procedures and applications
Theoretical Computer Science | 2015-05-22 | Paper |
On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science | 2014-01-10 | Paper |
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
Information and Computation | 2014-01-10 | Paper |
Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
Visualization of distributed algorithms based on graph relabelling systems
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Distributed Computing | 2013-02-04 | Paper |
Enumeration and leader election in partially anonymous and multi-hop broadcast networks
Fundamenta Informaticae | 2012-10-31 | Paper |
An optimal bit complexity randomized distributed MIS algorithm
Distributed Computing | 2012-02-06 | Paper |
On the power of synchronization between two adjacent processes
Distributed Computing | 2012-02-06 | Paper |
| scientific article; zbMATH DE number 5855082 (Why is no real title available?) | 2011-02-22 | Paper |
About randomised distributed graph colouring and graph partition algorithms
Information and Computation | 2010-10-22 | Paper |
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Local Terminations and Distributed Computability in Anonymous Networks
Lecture Notes in Computer Science | 2008-11-20 | Paper |
| scientific article; zbMATH DE number 5286867 (Why is no real title available?) | 2008-06-11 | Paper |
About the Termination Detection in the Asynchronous Message Passing Model
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks
Distributed Computing and Networking | 2008-03-06 | Paper |
| An efficient message passing election algorithm based on Mazurkiewicz's algorithm | 2008-01-02 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Graph Transformations
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Graph Transformations
Lecture Notes in Computer Science | 2007-06-21 | Paper |
| Local computations in graphs: the case of cellular edge local computations | 2007-01-19 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Locally guided randomized elections in trees: The totally fair case
Information and Computation | 2005-05-04 | 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 |
Analysis of a randomized rendezvous algorithm
Information and Computation | 2003-07-29 | Paper |
Randomized local elections.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1552336 (Why is no real title available?) | 2001-01-15 | Paper |
| scientific article; zbMATH DE number 1504828 (Why is no real title available?) | 2000-09-12 | Paper |
| scientific article; zbMATH DE number 1456964 (Why is no real title available?) | 2000-06-07 | Paper |
Checking Global Graph Properties by Means of Local Computations: the Majority Problem
Electronic Notes in Theoretical Computer Science | 1998-12-13 | Paper |
| scientific article; zbMATH DE number 1026280 (Why is no real title available?) | 1997-06-24 | Paper |
Medians and centres of polyominoes
Information Processing Letters | 1997-02-27 | Paper |
On the recognition of families of graphs with local computations
Information and Computation | 1995-12-13 | Paper |
New results on the star problem in trace monoids
Information and Computation | 1995-08-02 | Paper |
Different local controls for graph relabeling systems
Mathematical Systems Theory | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 475415 (Why is no real title available?) | 1994-10-31 | Paper |
Coverings and minors: Application to local computations in graphs
European Journal of Combinatorics | 1994-04-21 | Paper |
Asynchronous mappings and asynchronous cellular automata
Information and Computation | 1994-04-20 | Paper |
| scientific article; zbMATH DE number 512941 (Why is no real title available?) | 1994-04-07 | Paper |
Computing with graph rewriting systems with priorities
Theoretical Computer Science | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 219259 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177456 (Why is no real title available?) | 1993-05-18 | Paper |
ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
On recognizable subsets of free partially commutative monoids
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4072393 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4047130 (Why is no real title available?) | 1987-01-01 | Paper |
On lexicographic semi-commutations
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3956459 (Why is no real title available?) | 1986-01-01 | Paper |
Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
RAIRO - Theoretical Informatics and Applications | 1986-01-01 | Paper |
Recognizable subsets of some partially Abelian monoids
Theoretical Computer Science | 1985-01-01 | Paper |
Calcul de longueurs de chaînes de réécriture dans le monoïde libre
Theoretical Computer Science | 1985-01-01 | Paper |
About the rewriting systems produced by the Knuth-Bendix completion algorithm
Information Processing Letters | 1983-01-01 | Paper |
