Laurent Feuilloley

According to our database, Laurent Feuilloley authored at least 40 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Local certification of forbidden subgraphs.

Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun

CoRR, 2024

Global certification via perfect hashing.

Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun

CoRR, 2024

Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters.

Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC.

Laurent Feuilloley, Tijn de Vos

SIGACT News, December, 2023

A lower bound for constant-size local certification.

Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond

Theor. Comput. Sci., September, 2023

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

Discret. Math. Theor. Comput. Sci., 2023

Local certification of graphs with bounded genus.

Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca

Discret. Appl. Math., 2023

Pattern detection in ordered graphs.

Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois

CoRR, 2023

When Should You Wait Before Updating? - Toward a Robustness Refinement.

Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

Error-sensitive proof-labeling schemes.

Laurent Feuilloley, Pierre Fraigniaud

J. Parallel Distributed Comput., 2022

Short and local transformations between (Δ+1)-colorings.

Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie

CoRR, 2022

What can be certified compactly?

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

CoRR, 2022

What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs.

Laurent Feuilloley, Nicolas Bousquet, Théo Pierron

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings.

Laurent Feuilloley, Pierre Fraigniaud

ACM Trans. Parallel Comput., 2021

A hierarchy of local decision.

Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen

Theor. Comput. Sci., 2021

Graph Classes and Forbidden Patterns on Three Vertices.

Laurent Feuilloley, Michel Habib

SIAM J. Discret. Math., 2021

Introduction to local certification.

Laurent Feuilloley

Discret. Math. Theor. Comput. Sci., 2021

Redundancy in distributed proofs.

Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry

Distributed Comput., 2021

Classifying grounded intersection graphs via ordered forbidden patterns.

Laurent Feuilloley, Michel Habib

CoRR, 2021

Local certification of MSO properties for bounded treedepth graphs.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

CoRR, 2021

Compact Distributed Certification of Planar Graphs.

Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca

Algorithmica, 2021

Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

Proceedings of the 35th International Symposium on Distributed Computing, 2021

The Secretary Problem with Independent Sampling.

José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Local Certification of Graph Decompositions and Applications to Minor-Free Classes.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Distributed Recoloring of Interval and Chordal Graphs.

Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

How long it takes for an ordinary node with an ordinary id to output?

Laurent Feuilloley

Theor. Comput. Sci., 2020

Bibliography of distributed approximation on structurally sparse graph classes.

Laurent Feuilloley

CoRR, 2020

Silent MST Approximation for Tiny Memory.

Lélia Blin, Swan Dubois, Laurent Feuilloley

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

2019

Note on distributed certification of minimum spanning trees.

Laurent Feuilloley

CoRR, 2019

Memory Lower Bounds for Self-Stabilization.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

CoRR, 2019

Brief Announcement: Memory Lower Bounds for Self-Stabilization.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Lower bounds for text indexing with mismatches and differences.

Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Local certification in distributed computing: error-sensitivity, uniformity, redundancy, and interactivity. (Certification locale en calcul distribué : sensibilité aux erreurs, uniformité, redondance et interactivité).

Laurent Feuilloley

PhD thesis, 2018

Local Verification of Global Proofs.

Laurent Feuilloley, Juho Hirvonen

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2016

Survey of Distributed Decision.

Laurent Feuilloley, Pierre Fraigniaud

Bull. EATCS, 2016

2015

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.

José Correa, Laurent Feuilloley, Pablo Pérez-Lantero, José A. Soto

Discret. Comput. Geom., 2015

Locally Optimal Load Balancing.

Laurent Feuilloley, Juho Hirvonen, Jukka Suomela

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Randomized Local Network Computing.

Laurent Feuilloley, Pierre Fraigniaud

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Brief Announcement: Average Complexity for the LOCAL Model.

Laurent Feuilloley

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line.

José R. Correa, Laurent Feuilloley, José A. Soto

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014