Suivre
Laurent Feuilloley
Laurent Feuilloley
Université Claude Bernard Lyon 1
Adresse e-mail validée de irif.fr - Page d'accueil
Titre
Citée par
Citée par
Année
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
50*2015
SURVEY OF DISTRIBUTED DECISION
S Schmid, L Feuilloley, P Fraigniaud
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 41-65, 2016
48*2016
A hierarchy of local decision
L Feuilloley, P Fraigniaud, J Hirvonen
Theoretical Computer Science 856, 51-67, 2021
34*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
22*2021
Redundancy in distributed proofs
L Feuilloley, P Fraigniaud, J Hirvonen, A Paz, M Perry
Distributed Computing, 1-20, 2020
202020
Compact distributed certification of planar graphs
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca
Algorithmica 83 (7), 2215-2244, 2021
142021
Error-sensitive proof-labeling schemes
L Feuilloley, P Fraigniaud
International Symposium on Distributed Computing, 2017
13*2017
Introduction to local certification
L Feuilloley
Discrete Mathematics & Theoretical Computer Science 23, 2021
122021
Local certification of graphs with bounded genus
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, E Rémila, I Todinca
arXiv preprint arXiv:2007.08084, 2020
122020
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
102021
Local certification of graph decompositions and applications to minor-free classes
N Bousquet, L Feuilloley, T Pierron
arXiv preprint arXiv:2108.00059, 2021
8*2021
Local verification of global proofs
L Feuilloley, J Hirvonen
International Symposium on Distributed Computing 121, 25:1-25:17, 2018
82018
Graph classes and forbidden patterns on three vertices
L Feuilloley, M Habib
SIAM Journal on Discrete Mathematics 35 (1), 55-90, 2021
72021
How long it takes for an ordinary node with an ordinary id to output?
L Feuilloley
Theoretical Computer Science 811, 42-55, 2020
72020
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
International Symposium on Distributed Computing, 544-558, 2015
62015
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
arXiv preprint arXiv:1905.08563, 2019
3*2019
What can be certified compactly?
N Bousquet, L Feuilloley, T Pierron
arXiv preprint arXiv:2202.06065, 2022
2*2022
Note on distributed certification of minimum spanning trees
L Feuilloley
arXiv preprint arXiv:1909.07251, 2019
22019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20