Behnam Hashemi

28 papers Journal 28

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format. Appl. Math. Lett. Alberto Bucci, Behnam Hashemi
2025	J	`jnl`	Instability of the Sherman-Morrison formula and stabilization by iterative refinement. CoRR Behnam Hashemi, Yuji Nakatsukasa
2025	J	`jnl`	LREI: A fast numerical solver for quantum Landau-Lifshitz equations. CoRR Davoud Mirzaei, Behnam Hashemi, Vahid Azimi-Mousolou
2024	J	`jnl`	A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format. CoRR Alberto Bucci, Behnam Hashemi
2024	J	`jnl`	The Laurent-Horner method for validated evaluation of Chebyshev expansions. CoRR Jared Lee Aurentz, Behnam Hashemi
2023	J	`jnl`	RTSMS: Randomized Tucker with single-mode sketching. CoRR Behnam Hashemi, Yuji Nakatsukasa
2022	J	`jnl`	Least-Squares Spectral Methods for ODE Eigenvalue Problems. SIAM J. Sci. Comput. Behnam Hashemi, Yuji Nakatsukasa
2022	J	`jnl`	Rectangular eigenvalue problems. Adv. Comput. Math. Behnam Hashemi, Yuji Nakatsukasa, Lloyd N. Trefethen
2021	J	`jnl`	Least-squares spectral methods for ODE eigenvalue problems. CoRR Behnam Hashemi, Yuji Nakatsukasa
2021	J	`jnl`	Rectangular eigenvalue problems. CoRR Behnam Hashemi, Yuji Nakatsukasa, Lloyd N. Trefethen
2021	J	`jnl`	Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation. Appl. Math. Lett. Behnam Hashemi
2020	J	`jnl`	Computing Enclosures for the Matrix Exponential. SIAM J. Matrix Anal. Appl. Andreas Frommer, Behnam Hashemi
2020	J	`jnl`	The Laurent-Horner method for validated evaluation of Chebyshev expansions. Appl. Math. Lett. Jared Lee Aurentz, Behnam Hashemi
2019	J	`jnl`	Enclosing Chebyshev Expansions in Linear Time. ACM Trans. Math. Softw. Behnam Hashemi
2017	J	`jnl`	Chebfun in Three Dimensions. SIAM J. Sci. Comput. Behnam Hashemi, Lloyd N. Trefethen
2015	J	`jnl`	Three Methods for Solving Generalized Sylvester Matrix Equations Over Boolean Algebra. J. Multiple Valued Log. Soft Comput. Behnam Hashemi, Mahsa Nasrollahi Shirazi, Hanieh Tavakolipour
2013	J	`jnl`	A Non-Induced Interval Matrix Norm. Reliab. Comput. Behnam Hashemi, Hanieh Tavakolipour
2012	J	`jnl`	The interval Lyapunov matrix equation: Analytical results and an efficient numerical technique for outer estimation of the united solution set. Math. Comput. Model. Behnam Hashemi, Mehdi Dehghan
2011	J	`jnl`	Results concerning interval linear systems with multiple right-hand sides and the interval matrix equation AX=B. J. Comput. Appl. Math. Behnam Hashemi, Mehdi Dehghan
2009	J	`jnl`	Inverse of a fuzzy matrix of fuzzy numbers. Int. J. Comput. Math. Mehdi Dehghan, Mehdi Ghatee, Behnam Hashemi
2009	J	`jnl`	Verified Computation of Square Roots of a Matrix. SIAM J. Matrix Anal. Appl. Andreas Frommer, Behnam Hashemi
2008	J	`jnl`	Some Computations on Fuzzy Matrices: an Application in Fuzzy Analytical Hierarchy Process. Int. J. Uncertain. Fuzziness Knowl. Based Syst. Mehdi Dehghan, Mehdi Ghatee, Behnam Hashemi
2008	J	`jnl`	The solution and duality of imprecise network problems. Comput. Math. Appl. Mehdi Ghatee, S. Mehdi Hashemi, Behnam Hashemi, Mehdi Dehghan
2007	J	`jnl`	Determination of the degrees of P-property and nonnegative invertibility for a fuzzy matrix. Int. J. Approx. Reason. Mehdi Dehghan, Behnam Hashemi
2006	J	`jnl`	Computational methods for solving fully fuzzy linear systems. Appl. Math. Comput. Mehdi Dehghan, Behnam Hashemi, Mehdi Ghatee
2006	J	`jnl`	Fuzzy goal programming: Complementary slackness conditions and computational schemes. Appl. Math. Comput. S. Mehdi Hashemi, Mehdi Ghatee, Behnam Hashemi
2006	J	`jnl`	Iterative solution of fuzzy linear systems. Appl. Math. Comput. Mehdi Dehghan, Behnam Hashemi
2006	J	`jnl`	Solution of the fully fuzzy linear systems using the decomposition procedure. Appl. Math. Comput. Mehdi Dehghan, Behnam Hashemi

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.