Obserwuj
Laurent Feuilloley
Laurent Feuilloley
CNRS, LIRIS, Université Lyon 1
Zweryfikowany adres z univ-lyon1.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
722015
SURVEY OF DISTRIBUTED DECISION
S Schmid, L Feuilloley, P Fraigniaud
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 41-65, 2016
63*2016
A hierarchy of local decision
L Feuilloley, P Fraigniaud, J Hirvonen
Theoretical Computer Science 856, 51-67, 2021
46*2021
Redundancy in distributed proofs
L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry
Distributed Computing, 1-20, 2020
402020
The secretary problem with independent sampling
J Correa, A Cristi, L Feuilloley, T Oosterwijk, A Tsigonias-Dimitriadis
Management Science, 2024
382024
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
382020
Introduction to local certification
L Feuilloley
Discrete Mathematics & Theoretical Computer Science 23 (Distributed …, 2021
362021
Local certification of graph decompositions and applications to minor-free classes
N Bousquet, L Feuilloley, T Pierron
OPODIS 2021, 2021
292021
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
272023
Randomized local network computing: Derandomization beyond locally checkable labelings
L Feuilloley, P Fraigniaud
ACM Transactions on Parallel Computing (TOPC) 8 (4), 1-25, 2021
25*2021
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
24*2022
Graph classes and forbidden patterns on three vertices
L Feuilloley, M Habib
SIAM Journal on Discrete Mathematics 35 (1), 55-90, 2021
212021
How long it takes for an ordinary node with an ordinary id to output?
L Feuilloley
Theoretical Computer Science 811, 42-55, 2020
19*2020
Local verification of global proofs
L Feuilloley, J Hirvonen
International Symposium on Distributed Computing 121, 25:1-25:17, 2018
192018
Error-sensitive proof-labeling schemes
L Feuilloley, P Fraigniaud
Journal of Parallel and Distributed Computing 166, 149-165, 2022
182022
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
92019
Optimal space lower bound for deterministic self-stabilizing leader election algorithms
L Blin, L Feuilloley, G Le Bouder
Discrete Mathematics & Theoretical Computer Science 25 (Distributed …, 2023
8*2023
Locally optimal load balancing
L Feuilloley, J Hirvonen, J Suomela
International Symposium on Distributed Computing, 544-558, 2015
72015
Local certification of local properties: tight bounds, trade-offs and new parameters
N Bousquet, L Feuilloley, S Zeitoun
arXiv preprint arXiv:2312.13702, 2023
52023
Bibliography of distributed approximation beyond bounded degree
L Feuilloley
arXiv preprint arXiv:2001.08510, 2020
5*2020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20