Bento Natura - RankMe

25 papers A* 5A 4B 1Journal 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Circuit Diameter of Polyhedra is Strongly Polynomial. CoRR Bento Natura
2025	A	`conf`	A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). STACS Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2025	J	`jnl`	Interior Point Methods Are Not Worse than Simplex. SIAM J. Comput. Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2024	A*	`conf`	A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2024	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2024	J	`jnl`	On circuit diameter bounds via circuit imbalances. Math. Program. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2023	J	`jnl`	A Faster Interior-Point Method for Sum-of-Squares Optimization. Algorithmica Shunhua Jiang, Bento Natura, Omri Weinstein
2023	J	`jnl`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. Math. Oper. Res. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2023	J	`jnl`	Global Interconnect Optimization. ACM Trans. Design Autom. Electr. Syst. Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter
2022	A*	`conf`	A Faster Interior-Point Method for Sum-Of-Squares Optimization. ICALP Shunhua Jiang, Bento Natura, Omri Weinstein
2022	J	`jnl`	A Faster Interior-Point Method for Sum-of-Squares Optimization. CoRR Shunhua Jiang, Bento Natura, Omri Weinstein
2022	A*	`conf`	Interior point methods are not worse than Simplex. FOCS Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	J	`jnl`	Interior point methods are not worse than Simplex. CoRR Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	B	`conf`	On Circuit Diameter Bounds via Circuit Imbalances. IPCO Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2022	A	`conf`	The Pareto Cover Problem. ESA Bento Natura, Meike Neuwohner, Stefan Weltge
2022	J	`jnl`	The Pareto cover problem. CoRR Bento Natura, Meike Neuwohner, Stefan Weltge
2021	A	`conf`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021	J	`jnl`	Circuit imbalance measures and linear programming. CoRR Farbod Ekbatani, Bento Natura, László A. Végh
2021	J	`jnl`	On Circuit Diameter Bounds via Circuit Imbalances. CoRR Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2020	J	`jnl`	A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality. CoRR Zhuan Khye Koh, Bento Natura, László A. Végh
2020	A*	`conf`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2020	A*	`conf`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. FOCS Daniel Dadush, Bento Natura, László A. Végh
2020	J	`jnl`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. CoRR Daniel Dadush, Bento Natura, László A. Végh
2019	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2019	A	`conf`	Global Interconnect Optimization. ICCAD Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter

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.