default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Feuilloley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Nicolas Bousquet, Laurent Feuilloley
, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. J. Parallel Distributed Comput. 193: 104954 (2024)- [c23]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Brief Announcement: Global certification via perfect hashing. PODC 2024: 429-431 - [c22]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. STACS 2024: 21:1-21:18 - [i34]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Global certification via perfect hashing. CoRR abs/2402.03849 (2024) - [i33]Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun:
Local certification of forbidden subgraphs. CoRR abs/2402.12148 (2024) - [i32]Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek:
Decreasing verification radius in local certification. CoRR abs/2408.10757 (2024) - [i31]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
How local constraints influence network diameter and applications to LCL generalizations. CoRR abs/2409.01305 (2024) - [i30]Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun:
Renaming in distributed certification. CoRR abs/2409.15404 (2024) - 2023
- [j14]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - [j13]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 25 (2023) - [j12]Laurent Feuilloley, Tijn de Vos:
The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC. SIGACT News 54(4): 94-107 (2023) - [j11]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
A lower bound for constant-size local certification. Theor. Comput. Sci. 971: 114068 (2023) - [c21]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? - Toward a Robustness Refinement. SAND 2023: 7:1-7:15 - [i29]Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois:
Pattern detection in ordered graphs. CoRR abs/2302.11619 (2023) - [i28]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? Toward a Robustness Refinement. CoRR abs/2304.05831 (2023) - [i27]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Local certification of local properties: tight bounds, trade-offs and new parameters. CoRR abs/2312.13702 (2023) - 2022
- [j10]Laurent Feuilloley, Pierre Fraigniaud:
Error-sensitive proof-labeling schemes. J. Parallel Distributed Comput. 166: 149-165 (2022) - [c20]Laurent Feuilloley, Nicolas Bousquet, Théo Pierron:
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC 2022: 131-140 - [c19]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower Bound for Constant-Size Local Certification. SSS 2022: 239-253 - [i26]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
What can be certified compactly? CoRR abs/2202.06065 (2022) - [i25]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Short and local transformations between (Δ+1)-colorings. CoRR abs/2203.08885 (2022) - [i24]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower bound for constant-size local certification. CoRR abs/2208.14229 (2022) - 2021
- [j9]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j8]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in distributed proofs. Distributed Comput. 34(2): 113-132 (2021) - [j7]Laurent Feuilloley:
Introduction to local certification. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j6]Laurent Feuilloley, Michel Habib:
Graph Classes and Forbidden Patterns on Three Vertices. SIAM J. Discret. Math. 35(1): 55-90 (2021) - [j5]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A hierarchy of local decision. Theor. Comput. Sci. 856: 51-67 (2021) - [j4]Laurent Feuilloley, Pierre Fraigniaud:
Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Trans. Parallel Comput. 8(4): 18:1-18:25 (2021) - [c18]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Distributed Recoloring of Interval and Chordal Graphs. OPODIS 2021: 19:1-19:17 - [c17]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS 2021: 22:1-22:17 - [c16]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS 2021: 24:1-24:12 - [c15]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis:
The Secretary Problem with Independent Sampling. SODA 2021: 2047-2058 - [c14]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC 2021: 49:1-49:4 - [i23]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. CoRR abs/2108.00059 (2021) - [i22]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Distributed recoloring of interval and chordal graphs. CoRR abs/2109.06021 (2021) - [i21]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of MSO properties for bounded treedepth graphs. CoRR abs/2110.01936 (2021) - [i20]Laurent Feuilloley, Michel Habib:
Classifying grounded intersection graphs via ordered forbidden patterns. CoRR abs/2112.00629 (2021) - 2020
- [j3]Laurent Feuilloley:
How long it takes for an ordinary node with an ordinary id to output? Theor. Comput. Sci. 811: 42-55 (2020) - [c13]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [c12]Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST Approximation for Tiny Memory. SSS 2020: 118-132 - [i19]Laurent Feuilloley:
Bibliography of distributed approximation on structurally sparse graph classes. CoRR abs/2001.08510 (2020) - [i18]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i17]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca:
Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020) - [i16]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis:
The Secretary Problem with Independent Sampling. CoRR abs/2011.07869 (2020)
2010 – 2019
- 2019
- [c11]Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya:
Lower bounds for text indexing with mismatches and differences. SODA 2019: 1146-1164 - [c10]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC 2019: 37:1-37:3 - [i15]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Memory Lower Bounds for Self-Stabilization. CoRR abs/1905.08563 (2019) - [i14]Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST approximation for tiny memory. CoRR abs/1905.08565 (2019) - [i13]Laurent Feuilloley:
Note on distributed certification of minimum spanning trees. CoRR abs/1909.07251 (2019) - [i12]Laurent Feuilloley:
Introduction to local certification. CoRR abs/1910.12747 (2019) - 2018
- [b1]Laurent Feuilloley:
Local certification in distributed computing: error-sensitivity, uniformity, redundancy, and interactivity. (Certification locale en calcul distribué : sensibilité aux erreurs, uniformité, redondance et interactivité). Paris Diderot University, France, 2018 - [c9]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. DISC 2018: 24:1-24:18 - [c8]Laurent Feuilloley, Juho Hirvonen:
Local Verification of Global Proofs. DISC 2018: 25:1-25:17 - [i11]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. CoRR abs/1803.03031 (2018) - [i10]Laurent Feuilloley, Juho Hirvonen:
Local verification of global proofs. CoRR abs/1803.09553 (2018) - [i9]Laurent Feuilloley, Michel Habib:
Graph classes and forbidden patterns on three vertices. CoRR abs/1812.05913 (2018) - [i8]Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya:
Lower bounds for text indexing with mismatches and differences. CoRR abs/1812.09120 (2018) - 2017
- [c7]Laurent Feuilloley:
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? SIROCCO 2017: 263-282 - [c6]Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. DISC 2017: 16:1-16:15 - [i7]Laurent Feuilloley:
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? CoRR abs/1704.05739 (2017) - [i6]Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. CoRR abs/1705.04144 (2017) - 2016
- [j2]Laurent Feuilloley, Pierre Fraigniaud:
Survey of Distributed Decision. Bull. EATCS 119 (2016) - [c5]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A Hierarchy of Local Decision. ICALP 2016: 118:1-118:15 - [i5]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A hierarchy of local decision. CoRR abs/1602.08925 (2016) - [i4]Laurent Feuilloley, Pierre Fraigniaud:
Survey of Distributed Decision. CoRR abs/1606.04434 (2016) - 2015
- [j1]José Correa, Laurent Feuilloley, Pablo Pérez-Lantero, José A. Soto:
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. Discret. Comput. Geom. 53(2): 344-365 (2015) - [c4]Laurent Feuilloley:
Brief Announcement: Average Complexity for the LOCAL Model. PODC 2015: 335-337 - [c3]Laurent Feuilloley, Pierre Fraigniaud:
Randomized Local Network Computing. SPAA 2015: 340-349 - [c2]Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. DISC 2015: 544-558 - [i3]Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. CoRR abs/1502.04511 (2015) - [i2]Laurent Feuilloley:
Brief Announcement : Average Complexity for the LOCAL Model. CoRR abs/1505.05072 (2015) - 2014
- [c1]José R. Correa, Laurent Feuilloley, José A. Soto:
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. LATIN 2014: 35-46 - 2013
- [i1]José R. Correa, Laurent Feuilloley, José A. Soto:
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. CoRR abs/1309.6659 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
