Adeline Pierrot

18 papers A 1B 1C 1Journal 14Unranked 1

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings. Int. J. Approx. Reason. Pierre Andrieu, Sarah Cohen-Boulakia, Miguel Couceiro, Alain Denise, Adeline Pierrot
2022	J	`jnl`	Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. Comb. Theory Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2022	J	`jnl`	Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2021	J	`jnl`	Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2019	—	`conf`	Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2018	C	`conf`	Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. IWOCA Robin Milosz, Sylvie Hamel, Adeline Pierrot
2017	J	`jnl`	2-Stack Sorting is Polynomial. Theory Comput. Syst. Adeline Pierrot, Dominique Rossin
2017	J	`jnl`	An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015	J	`jnl`	An algorithm computing combinatorial specifications of permutation classes. CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015	J	`jnl`	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2014	A	`conf`	2-Stack Sorting is polynomial. STACS Adeline Pierrot, Dominique Rossin
2013	J	`jnl`	2-Stack Sorting is polynomial CoRR Adeline Pierrot, Dominique Rossin
2013	J	`jnl`	2-stack pushall sortable permutations CoRR Adeline Pierrot, Dominique Rossin
2013	J	`jnl`	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2013	B	`conf`	Single and Multiple Consecutive Permutation Motif Search. ISAAC Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2013	J	`jnl`	Single and multiple consecutive permutation motif search CoRR Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2012	J	`jnl`	Simple permutations poset CoRR Adeline Pierrot, Dominique Rossin
2010	J	`jnl`	Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin

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.