Patrick Greaves

13 papers A* 1A 1B 5Journal 6

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	A Practical Algorithm for 3-Admissibility. SOFSEM Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2026	B	`conf`	Counting Large Patterns in Degenerate Graphs. SOFSEM Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2026	B	`conf`	Efficient Trace Frequency Queries in Sparse Graphs. SOFSEM Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2025	B	`conf`	A Practical Algorithm for 2-Admissibility. SEA Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A practical algorithm for 2-admissibility. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A practical algorithm for 3-admissibility. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl
2025	J	`jnl`	Counting large patterns in degenerate graphs. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	Efficient Trace Frequency Queries in Sparse Graphs. CoRR Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2025	A	`conf`	Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. STACS Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	A*	`conf`	Testing C_k-Freeness in Bounded Admissibility Graphs. ICALP Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl
2023	B	`conf`	Computing Complexity Measures of Degenerate Graphs. IPEC Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
2023	J	`jnl`	Computing complexity measures of degenerate graphs. CoRR Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl

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.