Laurent Feuilloley

From MaRDI portal
(Redirected from Laurent Feuilloley)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Renaming in distributed certification
Theoretical Computer Science
2025-12-12Paper
Local certification of local properties: tight bounds, trade-offs and new parameters2025-11-10Paper
Decreasing verification radius in local certification
Theoretical Computer Science
2025-11-10Paper
Local certification of local properties: tight bounds, trade-offs, and new parameters
SIAM Journal on Discrete Mathematics
2025-10-10Paper
Brief announcement: Global certification via perfect hashing2025-06-13Paper
When should you wait before updating? -- Toward a robustness refinement
Theoretical Computer Science
2025-05-04Paper
Short and local transformations between ( +1)-colorings
Innovations in Graph Theory
2025-04-07Paper
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Discrete Mathematics & Theoretical Computer Science
2024-04-18Paper
scientific article; zbMATH DE number 7832760 (Why is no real title available?)
(available as arXiv preprint)
2024-04-15Paper
Local Certification of Graph Decompositions and Applications to Minor-Free Classes2024-04-15Paper
scientific article; zbMATH DE number 7832765 (Why is no real title available?)
(available as arXiv preprint)
2024-04-15Paper
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
scientific article; zbMATH DE number 7788460 (Why is no real title available?)
(available as arXiv preprint)
2024-01-15Paper
scientific article; zbMATH DE number 7774300 (Why is no real title available?)
(available as arXiv preprint)
2023-12-08Paper
A lower bound for constant-size local certification
Theoretical Computer Science
2023-08-18Paper
Lower bound for constant-size local certification
Lecture Notes in Computer Science
2023-06-12Paper
Silent MST Approximation for Tiny Memory2023-03-21Paper
Error-sensitive proof-labeling schemes2023-02-03Paper
Local certification of graphs with bounded genus
Discrete Applied Mathematics
2022-12-08Paper
Redundancy in distributed proofs2022-07-21Paper
Local verification of global proofs
(available as arXiv preprint)
2022-07-21Paper
Short and local transformations between ($\Delta+1$)-colorings2022-03-16Paper
Introduction to local certification
Discrete Mathematics & Theoretical Computer Science
2022-01-27Paper
Introduction to local certification
Discrete Mathematics & Theoretical Computer Science
2022-01-27Paper
Classifying grounded intersection graphs via ordered forbidden patterns2021-12-01Paper
Compact distributed certification of planar graphs
Algorithmica
2021-06-30Paper
Redundancy in distributed proofs
Distributed Computing
2021-05-17Paper
Graph classes and forbidden patterns on three vertices
SIAM Journal on Discrete Mathematics
2021-03-18Paper
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing
2021-03-15Paper
A hierarchy of local decision
Theoretical Computer Science
2021-01-19Paper
Classifying grounded intersection graphs via ordered forbidden patterns
(available as arXiv preprint)
2021-01-01Paper
How long it takes for an ordinary node with an ordinary ID to output?
Theoretical Computer Science
2020-02-13Paper
Lower bounds for text indexing with mismatches and differences
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Survey of distributed decision
(available as arXiv preprint)
2019-07-03Paper
Survey of distributed decision2019-07-03Paper
Locally optimal load balancing
(available as arXiv preprint)
2018-08-24Paper
How long it takes for an ordinary node with an ordinary ID to output?
Lecture Notes in Computer Science
2018-04-12Paper
scientific article; zbMATH DE number 6820307 (Why is no real title available?)
(available as arXiv preprint)
2017-12-19Paper
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry
2015-04-16Paper
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry
2015-04-16Paper
Independent and hitting sets of rectangles intersecting a diagonal line
LATIN 2014: Theoretical Informatics
2014-03-31Paper


Research outcomes over time


This page was built for person: Laurent Feuilloley