Gennadi I. Malaschonok

32 papers B 5Misc 1Journal 26

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	LSU factorization. CoRR Gennadi I. Malaschonok
2025	J	`jnl`	MathPartner is a breakthrough technology for natural sciences education, scientic and engineering applications. CoRR Gennadi I. Malaschonok, Roman Sakh
2025	J	`jnl`	Recursive matrix algorithms, distributed dynamic control, scaling, stability. CoRR Gennadi I. Malaschonok
2024	J	`jnl`	MathPartner: An Artificial Intelligence Cloud Service. CoRR Gennadi I. Malaschonok, Alexander V. Seliverstov
2023	J	`jnl`	Supercomputer Environment for Recursive Matrix Algorithms. CoRR Gennadi I. Malaschonok, Alla A. Sidko
2022	J	`jnl`	About MathPartner web service. CoRR Gennadi I. Malaschonok, Ivan Borisov
2022	J	`jnl`	Calculation of Integrals in MathPartner. CoRR Gennadi I. Malaschonok, Alexander V. Seliverstov
2022	J	`jnl`	MathPartner Computer Algebra. CoRR Gennadi I. Malaschonok
2022	J	`jnl`	New features in MathPartner 2021. CoRR Gennadi I. Malaschonok, Alexander Seliverstov
2022	J	`jnl`	Supercomputer Environment for Recursive Matrix Algorithms. Program. Comput. Softw. Gennadi I. Malaschonok, Alla A. Sidko
2020	J	`jnl`	LDU factorization. CoRR Gennadi I. Malaschonok
2019	J	`jnl`	Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory. CoRR Gennadi I. Malaschonok, Evgeni Ilchenko
2017	J	`jnl`	Algorithms for the Computing Determinants in Commutative Rings. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Algorithms for the solution of systems of linear equations in commutative ring. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Computation of the Adjoint Matrix. CoRR Alkiviadis G. Akritas, Gennadi I. Malaschonok
2017	J	`jnl`	Effective Matrix Methods in Commutative Domains. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Fast generalized Bruhat decomposition. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Generalized Bruhat decomposition in commutative domains. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	MathPartner computer algebra. Program. Comput. Softw. Gennadi I. Malaschonok
2017	J	`jnl`	Recursive Method for the Solution of Systems of Linear Equations. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Solution of a System of Linear Equations in an Integral Ring. CoRR Gennadi I. Malaschonok
2017	J	`jnl`	Triangular Decomposition of Matrices in a Domain. CoRR Gennadi I. Malaschonok, Anton Scherbinin
2015	B	`conf`	Triangular Decomposition of Matrices in a Domain. CASC Gennadi I. Malaschonok, Anton Scherbinin
2013	B	`conf`	Generalized Bruhat Decomposition in Commutative Domains. CASC Gennadi I. Malaschonok
2010	B	`conf`	Fast Generalized Bruhat Decomposition. CASC Gennadi I. Malaschonok
2007	B	`conf`	Computations in Modules over Commutative Domains. CASC Alkiviadis G. Akritas, Gennadi I. Malaschonok
2006	Misc	`conf`	Computation of the Adjoint Matrix. International Conference on Computational Science (2) Alkiviadis G. Akritas, Gennadi I. Malaschonok
2004	J	`jnl`	Applications of singular-value decomposition (SVD). Math. Comput. Simul. Alkiviadis G. Akritas, Gennadi I. Malaschonok
2004	J	`jnl`	Fast Multiplication and Sparse Structures. Program. Comput. Softw. Gennadi I. Malaschonok, E. S. Satina
2003	J	`jnl`	Solution of Systems of Linear Equations by the p-Adic Method. Program. Comput. Softw. Gennadi I. Malaschonok
2001	B	`conf`	Solution of Systems of Linear Diophantine Equations. CASC Gennadi I. Malaschonok
1995	J	`jnl`	Matrix computation of subresultant polynomial remainder sequences in integral domains. Reliab. Comput. Alkiviadis G. Akritas, Evgenia K. Akritas, Gennadi I. Malaschonok

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.