Laurent Feuilloley
YOU?
Author Swipe
View article: Renaming in distributed certification
Renaming in distributed certification Open
View article: Proving there is a leader without naming it
Proving there is a leader without naming it Open
Local certification is a mechanism for certifying to the nodes of a network that a certain property holds. In this framework, nodes are assigned labels, called certificates, which are supposed to prove that the property holds. The nodes th…
View article: When should you wait before updating? - Toward a robustness refinement
When should you wait before updating? - Toward a robustness refinement Open
View article: Short and local transformations between ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Δ</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> )-colorings
Short and local transformations between ( )-colorings Open
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring to a target coloring . Adding the constraint that each pair of consecutive colorings must differ on exactly one vertex, one asks:…
View article: How Local Constraints Influence Network Diameter and Applications to LCL Generalizations
How Local Constraints Influence Network Diameter and Applications to LCL Generalizations Open
In this paper, we investigate how local rules enforced at every node can influence the topology of a network. More precisely, we establish several results on the diameter of trees as a function of the number of nodes, as listed below. Thes…
View article: Complexity Landscape for Local Certification
Complexity Landscape for Local Certification Open
An impressive recent line of work has charted the complexity landscape of distributed graph algorithms. For many settings, it has been determined which time complexities exist, and which do not (in the sense that no local problem could hav…
View article: Decreasing Verification Radius in Local Certification
Decreasing Verification Radius in Local Certification Open
View article: Local certification of graph decompositions and applications to minor-free classes
Local certification of graph decompositions and applications to minor-free classes Open
View article: The Secretary Problem with Independent Sampling
The Secretary Problem with Independent Sampling Open
The secretary problem is probably the most well-studied optimal stopping problem with many applications in economics and management. In the secretary problem, a decision maker faces an unknown sequence of values, revealed successively, and…
View article: Brief Announcement: Global certification via perfect hashing
Brief Announcement: Global certification via perfect hashing Open
International audience
View article: Local certification of forbidden subgraphs
Local certification of forbidden subgraphs Open
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Rememb…
View article: Global certification via perfect hashing
Global certification via perfect hashing Open
In this work, we provide an upper bound for global certification of graph homomorphism, a generalization of graph coloring. In certification, the nodes of a network should decide if the network satisfies a given property, thanks to small p…
View article: Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters Open
Local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. For many classic global properties, like check…
View article: When Should You Wait Before Updating? Toward a Robustness Refinement
When Should You Wait Before Updating? Toward a Robustness Refinement Open
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specification, but that are different from an algorithmic perspective, …
View article: Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms Open
Given a boolean predicate $\Pi$ on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for $\Pi$ is a distributed algorithm that can start from any initial configuration of the network (i.e., every…
View article: Pattern detection in ordered graphs
Pattern detection in ordered graphs Open
A popular way to define or characterize graph classes is via forbidden subgraphs or forbidden minors. These characterizations play a key role in graph theory, but they rarely lead to efficient algorithms to recognize these classes. In cont…
View article: Compact Distributed Certification of Planar Graphs
Compact Distributed Certification of Planar Graphs Open
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distrib…
View article: Silent MST Approximation for Tiny Memory
Silent MST Approximation for Tiny Memory Open
In this paper we show that approximation can help reduce the space used for self-stabilization. In the classic state model, where the nodes of a network communicate by reading the states of their neighbors, an important measure of efficien…
View article: Local certification of graphs with bounded genus
Local certification of graphs with bounded genus Open
View article: Lower bound for constant-size local certification
Lower bound for constant-size local certification Open
Given a network property or a data structure, a local certification is a labeling that allows to efficiently check that the property is satisfied, or that the structure is correct. The quality of a certification is measured by the size of …
View article: What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs Open
International audience
View article: Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'élection
Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'élection Open
International audience
View article: Short and local transformations between ($\Delta+1$)-colorings
Short and local transformations between ($\Delta+1$)-colorings Open
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring $\sigma$ to a target coloring $\eta$. Each pair of consecutive colorings must differ on exactly one vertex. The question becomes: is …
View article: Classifying grounded intersection graphs via ordered forbidden patterns
Classifying grounded intersection graphs via ordered forbidden patterns Open
Second version with some citations added, thanks to Istvan Tomon
View article: Error-sensitive proof-labeling schemes
Error-sensitive proof-labeling schemes Open
View article: Short and local transformations between ($Δ+1$)-colorings
Short and local transformations between ($Δ+1$)-colorings Open
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring $σ$ to a target coloring $η$. Adding the constraint that each pair of consecutive colorings must differ on exactly one vertex, one as…
View article: What can be certified compactly?
What can be certified compactly? Open
Local certification consists in assigning labels (called \emph{certificates}) to the nodes of a network to certify a property of the network or the correctness of a data structure distributed on the network. The verification of this certif…
View article: Distributed Recoloring of Interval and Chordal Graphs
Distributed Recoloring of Interval and Chordal Graphs Open
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions. Fir…
View article: Lower Bound for Constant-Size Local Certification
Lower Bound for Constant-Size Local Certification Open
View article: Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Local Certification of Graph Decompositions and Applications to Minor-Free Classes Open