Elfarouk Harb - RankMe

21 papers A* 4A 2B 1Journal 13Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems. CoRR Elfarouk Harb, Yousef Yassin, Chandra Chekuri
2025	J	`jnl`	Dense Subgraph Clustering and a New Cluster Ensemble Method. CoRR The-Anh Vu-Le, João Alfredo Cardoso Lamy, Tomás Alessi, Ian Chen, Minhyuk Park, Elfarouk Harb, George Chacko, Tandy J. Warnow
2025	A*	`conf`	New Prophet Inequalities via Poissonization and Sharding. SODA Elfarouk Harb
2025	J	`jnl`	ReFill: Reinforcement Learning for Fill-In Minimization. CoRR Elfarouk Harb, Ho Shan Lam
2024	A*	`conf`	Oracle-Augmented Prophet Inequalities. ICALP Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024	J	`jnl`	Oracle-Augmented Prophet Inequalities. CoRR Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024	—	`conf`	Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA Sariel Har-Peled, Elfarouk Harb
2024	A	`conf`	Shortest Path Separators in Unit Disk Graphs. ESA Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2024	J	`jnl`	Shortest Path Separators in Unit Disk Graphs. CoRR Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2023	J	`jnl`	A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. IEEE Trans. Inf. Theory Mordecai J. Golin, Elfarouk Harb
2023	A	`conf`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Fishing For Better Constants: The Prophet Secretary Via Poissonization. CoRR Elfarouk Harb
2022	A*	`conf`	Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2022	J	`jnl`	Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR Sariel Har-Peled, Elfarouk Harb
2021	J	`jnl`	Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. Theor. Comput. Sci. Mordecai J. Golin, Elfarouk Harb
2020	A*	`conf`	KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering. NeurIPS Elfarouk Harb, Ho Shan Lam
2020	J	`jnl`	KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. CoRR Elfarouk Harb, Ho Shan Lam
2020	J	`jnl`	Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. CoRR Mordecai J. Golin, Elfarouk Harb
2020	J	`jnl`	Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. CoRR Mordecai J. Golin, Elfarouk Harb
2019	B	`conf`	Polynomial Time Algorithms for Constructing Optimal AIFV Codes. DCC Mordecai J. Golin, Elfarouk Harb

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.