Paolo Massazza

35 papers C 6Journal 22Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Efficient counting of RAIRO Theor. Informatics Appl. Anthony J. Guttmann, Paolo Massazza
2024	J	`jnl`	Asymptotics of Z-convex polyominoes. RAIRO Theor. Informatics Appl. Anthony J. Guttmann, Paolo Massazza
2024	J	`jnl`	Preface. RAIRO Theor. Informatics Appl. Luca Ferrari, Paolo Massazza
2022	—	`conf`	On Counting k-Convex Polyominoes. ICTCS Paolo Massazza
2021	J	`jnl`	A Dynamical System Approach to Polyominoes Generation. Fundam. Informaticae Paolo Massazza
2021	—	`conf`	On Counting L-Convex Polyominoes. ICTCS Valentina Dorigatti, Paolo Massazza
2021	C	`conf`	Partially Directed Animals with a Bounded Number of Holes. LATA Valentina Dorigatti, Paolo Massazza
2019	C	`conf`	Hole-Free Partially Directed Animals. DLT Paolo Massazza
2018	—	`conf`	On the Generating Functions of Languages Accepted by Deterministic One-reversal Counter Machines. ICTCS Paolo Massazza
2018	—	`conf`	On the Generation of 2-Polyominoes. DCFS Enrico Formenti, Paolo Massazza
2017	J	`jnl`	From Tetris to polyominoes generation. Electron. Notes Discret. Math. Enrico Formenti, Paolo Massazza
2017	J	`jnl`	On a class of languages with holonomic generating functions. Theor. Comput. Sci. Giusi Castiglione, Paolo Massazza
2017	C	`conf`	On the Conjecture ℒ CIAA Paolo Massazza
2017	J	`jnl`	On the exhaustive generation of k-convex polyominoes. Theor. Comput. Sci. Stefano Brocchi, Giusi Castiglione, Paolo Massazza
2016	J	`jnl`	A New Sandpile Model with Smoothness Assumptions. Fundam. Informaticae Stefano Brocchi, Paolo Massazza
2016	J	`jnl`	An efficient algorithm for generating symmetric ice piles. Theor. Comput. Sci. Roberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès
2015	J	`jnl`	On Computing the Degree of Convexity of Polyominoes. Electron. J. Comb. Stefano Brocchi, Giuseppa Castiglione, Paolo Massazza
2015	J	`jnl`	On the generation of convex polyominoes. Discret. Appl. Math. Paolo Massazza
2014	C	`conf`	An Efficient Algorithm for the Generation of Z-Convex Polyominoes. IWCIA Giusi Castiglione, Paolo Massazza
2014	—	`conf`	An efficient algorithm for generating symmetric ice piles. ICTCS Roberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès
2014	J	`jnl`	From Models to Languages. Fundam. Informaticae Pierpaolo Degano, Juhani Karhumäki, Paolo Massazza
2013	J	`jnl`	On the exhaustive generation of plane partitions. Theor. Comput. Sci. Roberto Mantaci, Paolo Massazza
2012	—	`conf`	Smooth Sand Piles. RP Stefano Brocchi, Paolo Massazza
2011	C	`conf`	From Linear Partitions to Parallelogram Polyominoes. Developments in Language Theory Roberto Mantaci, Paolo Massazza
2010	J	`jnl`	A CAT algorithm for the exhaustive generation of ice piles. RAIRO Theor. Informatics Appl. Paolo Massazza, Roberto Radicioni
2006	J	`jnl`	On the simplest centralizer of a language. RAIRO Theor. Informatics Appl. Paolo Massazza, Petri Salmela
2005	J	`jnl`	On computing the coefficients of bivariate holonomic formal series. Theor. Comput. Sci. Paolo Massazza, Roberto Radicioni
2005	C	`conf`	The Inclusion Problem for Unambiguous Rational Trace Languages. Developments in Language Theory Paolo Massazza
2001	J	`jnl`	On the Root of Languages. Int. J. Algebra Comput. Paolo Massazza
1998	J	`jnl`	On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages. RAIRO Theor. Informatics Appl. Alberto Bertoni, Paolo Massazza
1994	J	`jnl`	A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series. Int. J. Algebra Comput. Alberto Bertoni, Paolo Massazza
1993	J	`jnl`	Holonomic Functions and Their Relation to Linearly Constrained Languages. RAIRO Theor. Informatics Appl. Paolo Massazza
1992	J	`jnl`	Holonomic Generating Functions and Context Free Languages. Int. J. Found. Comput. Sci. Alberto Bertoni, Paolo Massazza, Nicoletta Sabadini
1990	J	`jnl`	Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. Inf. Process. Lett. Alberto Bertoni, Massimiliano Goldwurm, Paolo Massazza
1986	—	`conf`	A Symbolic Manipulation System for Combinatorial Problems. AAECC Paolo Massazza, Giancarlo Mauri, P. Righi, Mauro Torelli

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.