Suivre
Laurent Feuilloley
Laurent Feuilloley
CNRS, LIRIS, Université Lyon 1, Univ. Lyon
Adresse e-mail validée de univ-lyon1.fr - Page d'accueil
Titre
Citée par
Citée par
Année
SURVEY OF DISTRIBUTED DECISION
S Schmid, L Feuilloley, P Fraigniaud
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 41-65, 2016
57*2016
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
J Correa, L Feuilloley, P Pérez-Lantero, JA Soto
Discrete & Computational Geometry 53 (2), 344-365, 2015
42*2015
A hierarchy of local decision
L Feuilloley, P Fraigniaud, J Hirvonen
Theoretical Computer Science 856, 51-67, 2021
39*2021
Randomized local network computing: Derandomization beyond locally checkable labelings
L Feuilloley, P Fraigniaud
ACM Transactions on Parallel Computing (TOPC) 8 (4), 1-25, 2021
24*2021
The secretary problem with independent sampling
J Correa, A Cristi, L Feuilloley, T Oosterwijk, A Tsigonias-Dimitriadis
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
242021
Redundancy in distributed proofs
L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry
Distributed Computing, 1-20, 2020
242020
Compact distributed certification of planar graphs
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
232020
Local certification of graphs with bounded genus
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, E Rémila, I Todinca
Discrete Applied Mathematics 325, 9-36, 2023
172023
Introduction to local certification
L Feuilloley
Discrete Mathematics & Theoretical Computer Science 23, 2021
172021
Error-sensitive proof-labeling schemes
L Feuilloley, P Fraigniaud
Journal of Parallel and Distributed Computing 166, 149-165, 2022
15*2022
Local certification of graph decompositions and applications to minor-free classes
N Bousquet, L Feuilloley, T Pierron
OPODIS 2021, 2021
132021
Graph classes and forbidden patterns on three vertices
L Feuilloley, M Habib
SIAM Journal on Discrete Mathematics 35 (1), 55-90, 2021
112021
Local verification of global proofs
L Feuilloley, J Hirvonen
International Symposium on Distributed Computing 121, 25:1-25:17, 2018
112018
How long it takes for an ordinary node with an ordinary id to output?
L Feuilloley
Theoretical Computer Science 811, 42-55, 2020
102020
What can be certified compactly? compact local certification of MSO properties in tree-like graphs
L Feuilloley, N Bousquet, T Pierron
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
7*2022
Lower bounds for text indexing with mismatches and differences
V Cohen-Addad, L Feuilloley, T Starikovskaya
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
72019
Locally optimal load balancing
L Feuilloley, J Hirvonen, J Suomela
Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015
72015
Bibliography of distributed approximation beyond bounded degree
L Feuilloley
arXiv preprint arXiv:2001.08510, 2020
4*2020
Optimal space lower bound for deterministic self-stabilizing leader election algorithms
L Blin, L Feuilloley, GL Bouder
Discrete Mathematics & Theoretical Computer Science 25 (1), 2023
3*2023
Distributed recoloring of interval and chordal graphs
N Bousquet, L Feuilloley, M Heinrich, M Rabie
arXiv preprint arXiv:2109.06021, 2021
32021
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20