Laurent Feuilloley

84 papers A* 7A 8B 7C 2Journal 57Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Polynomial Time Local Decision Revisited. CoRR Laurent Feuilloley, Soumyadeep Paul, Ami Paz
2026	J	`jnl`	Renaming in distributed certification. Theor. Comput. Sci. Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun
2025	A	`conf`	Complexity Landscape for Local Certification. DISC Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2025	J	`jnl`	Complexity landscape for local certification. CoRR Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2025	J	`jnl`	Decreasing verification radius in local certification. Theor. Comput. Sci. Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2025	J	`jnl`	Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters. SIAM J. Discret. Math. Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2025	J	`jnl`	Proving there is a leader without naming it. CoRR Laurent Feuilloley, Josef Erik Sedlácek, Martin Slávik
2025	J	`jnl`	The Secretary Problem with Independent Sampling. Manag. Sci. José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis
2025	J	`jnl`	When should you wait before updating? - Toward a robustness refinement. Theor. Comput. Sci. Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie
2024	A*	`conf`	Brief Announcement: Global certification via perfect hashing. PODC Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2024	—	`conf`	Decreasing Verification Radius in Local Certification. ALGOWIN Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2024	J	`jnl`	Decreasing verification radius in local certification. CoRR Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2024	J	`jnl`	Global certification via perfect hashing. CoRR Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2024	B	`conf`	How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. OPODIS Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	J	`jnl`	How local constraints influence network diameter and applications to LCL generalizations. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	A	`conf`	Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. STACS Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2024	J	`jnl`	Local certification of forbidden subgraphs. CoRR Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun
2024	J	`jnl`	Local certification of graph decompositions and applications to minor-free classes. J. Parallel Distributed Comput. Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	J	`jnl`	Renaming in distributed certification. CoRR Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun
2023	J	`jnl`	A lower bound for constant-size local certification. Theor. Comput. Sci. Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2023	J	`jnl`	Local certification of graphs with bounded genus. Discret. Appl. Math. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2023	J	`jnl`	Local certification of local properties: tight bounds, trade-offs and new parameters. CoRR Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
2023	J	`jnl`	Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2023	J	`jnl`	Pattern detection in ordered graphs. CoRR Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois
2023	J	`jnl`	The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC. SIGACT News Laurent Feuilloley, Tijn de Vos
2023	—	`conf`	When Should You Wait Before Updating? - Toward a Robustness Refinement. SAND Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie
2023	J	`jnl`	When Should You Wait Before Updating? Toward a Robustness Refinement. CoRR Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie
2022	J	`jnl`	Error-sensitive proof-labeling schemes. J. Parallel Distributed Comput. Laurent Feuilloley, Pierre Fraigniaud
2022	C	`conf`	Lower Bound for Constant-Size Local Certification. SSS Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2022	J	`jnl`	Lower bound for constant-size local certification. CoRR Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2022	J	`jnl`	Short and local transformations between (Δ+1)-colorings. CoRR Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
2022	A*	`conf`	What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC Laurent Feuilloley, Nicolas Bousquet, Théo Pierron
2022	J	`jnl`	What can be certified compactly? CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	A hierarchy of local decision. Theor. Comput. Sci. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2021	A	`conf`	Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Classifying grounded intersection graphs via ordered forbidden patterns. CoRR Laurent Feuilloley, Michel Habib
2021	J	`jnl`	Compact Distributed Certification of Planar Graphs. Algorithmica Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2021	B	`conf`	Distributed Recoloring of Interval and Chordal Graphs. OPODIS Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
2021	J	`jnl`	Distributed recoloring of interval and chordal graphs. CoRR Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
2021	J	`jnl`	Graph Classes and Forbidden Patterns on Three Vertices. SIAM J. Discret. Math. Laurent Feuilloley, Michel Habib
2021	J	`jnl`	Introduction to local certification. Discret. Math. Theor. Comput. Sci. Laurent Feuilloley
2021	B	`conf`	Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Local certification of MSO properties for bounded treedepth graphs. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Local certification of graph decompositions and applications to minor-free classes. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	B	`conf`	Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2021	J	`jnl`	Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Trans. Parallel Comput. Laurent Feuilloley, Pierre Fraigniaud
2021	J	`jnl`	Redundancy in distributed proofs. Distributed Comput. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2021	A*	`conf`	The Secretary Problem with Independent Sampling. SODA José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis
2020	J	`jnl`	Bibliography of distributed approximation on structurally sparse graph classes. CoRR Laurent Feuilloley
2020	A*	`conf`	Compact Distributed Certification of Planar Graphs. PODC Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2020	J	`jnl`	Compact Distributed Certification of Planar Graphs. CoRR Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
2020	J	`jnl`	How long it takes for an ordinary node with an ordinary id to output? Theor. Comput. Sci. Laurent Feuilloley
2020	J	`jnl`	Local Certification of Graphs with Bounded Genus. CoRR Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
2020	C	`conf`	Silent MST Approximation for Tiny Memory. SSS Lélia Blin, Swan Dubois, Laurent Feuilloley
2020	J	`jnl`	The Secretary Problem with Independent Sampling. CoRR José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis
2019	A	`conf`	Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2019	J	`jnl`	Introduction to local certification. CoRR Laurent Feuilloley
2019	A*	`conf`	Lower bounds for text indexing with mismatches and differences. SODA Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
2019	J	`jnl`	Memory Lower Bounds for Self-Stabilization. CoRR Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2019	J	`jnl`	Note on distributed certification of minimum spanning trees. CoRR Laurent Feuilloley
2019	J	`jnl`	Silent MST approximation for tiny memory. CoRR Lélia Blin, Swan Dubois, Laurent Feuilloley
2018	J	`jnl`	Graph classes and forbidden patterns on three vertices. CoRR Laurent Feuilloley, Michel Habib
2018	A	`conf`	Local Verification of Global Proofs. DISC Laurent Feuilloley, Juho Hirvonen
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
2018	J	`jnl`	Local verification of global proofs. CoRR Laurent Feuilloley, Juho Hirvonen
2018	J	`jnl`	Lower bounds for text indexing with mismatches and differences. CoRR Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
2018	A	`conf`	Redundancy in Distributed Proofs. DISC Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2018	J	`jnl`	Redundancy in Distributed Proofs. CoRR Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2017	A	`conf`	Error-Sensitive Proof-Labeling Schemes. DISC Laurent Feuilloley, Pierre Fraigniaud
2017	J	`jnl`	Error-Sensitive Proof-Labeling Schemes. CoRR Laurent Feuilloley, Pierre Fraigniaud
2017	B	`conf`	How Long It Takes for an Ordinary Node with an Ordinary ID to Output? SIROCCO Laurent Feuilloley
2017	J	`jnl`	How Long It Takes for an Ordinary Node with an Ordinary ID to Output? CoRR Laurent Feuilloley
2016	A*	`conf`	A Hierarchy of Local Decision. ICALP Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2016	J	`jnl`	A hierarchy of local decision. CoRR Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2016	J	`jnl`	Survey of Distributed Decision. CoRR Laurent Feuilloley, Pierre Fraigniaud
2016	J	`jnl`	Survey of Distributed Decision. Bull. EATCS Laurent Feuilloley, Pierre Fraigniaud
2015	J	`jnl`	Brief Announcement : Average Complexity for the LOCAL Model. CoRR Laurent Feuilloley
2015	A*	`conf`	Brief Announcement: Average Complexity for the LOCAL Model. PODC Laurent Feuilloley
2015	J	`jnl`	Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. Discret. Comput. Geom. José Correa, Laurent Feuilloley, Pablo Pérez-Lantero, José A. Soto
2015	A	`conf`	Locally Optimal Load Balancing. DISC Laurent Feuilloley, Juho Hirvonen, Jukka Suomela
2015	J	`jnl`	Locally Optimal Load Balancing. CoRR Laurent Feuilloley, Juho Hirvonen, Jukka Suomela
2015	B	`conf`	Randomized Local Network Computing. SPAA Laurent Feuilloley, Pierre Fraigniaud
2014	B	`conf`	Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. LATIN José R. Correa, Laurent Feuilloley, José A. Soto
2013	J	`jnl`	Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. CoRR José R. Correa, Laurent Feuilloley, José A. Soto

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.