The following pages link to Laurent Feuilloley (Q1664163):
Displaying 23 items.
- Locally optimal load balancing (Q1664164) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- (Q4598260) (← links)
- (Q4967211) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090916) (← links)
- (Q5090917) (← links)
- Lower bounds for text indexing with mismatches and differences (Q5236254) (← links)
- Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line (Q5405026) (← links)
- Compact Distributed Certification of Planar Graphs (Q5855251) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- (Q6083430) (← links)
- (Q6128581) (← links)
- Local Certification of Graph Decompositions and Applications to Minor-Free Classes (Q6128586) (← links)
- (Q6128591) (← links)
- Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms (Q6131780) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
- Error-sensitive proof-labeling schemes (Q6487487) (← links)
