Oliver Friedmann

31 papers A* 3A 2B 3Journal 18Unranked 3

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	An exponential lower bound for Zadeh's pivot rule. Math. Program. Yann Disser, Oliver Friedmann, Alexander V. Hopp
2019	J	`jnl`	An Exponential Lower Bound for Zadeh's pivot rule. CoRR Yann Disser, Oliver Friedmann, Alexander V. Hopp
2017	J	`jnl`	An exponential lower bound for Cunningham's rule. Math. Program. David Avis, Oliver Friedmann
2015	J	`jnl`	On guarded transformation in the modal μ-calculus. Log. J. IGPL Florian Bruse, Oliver Friedmann, Martin Lange
2015	J	`jnl`	Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. Oliver Friedmann, Felix Klaedtke, Martin Lange
2014	J	`jnl`	Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2014	J	`jnl`	Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2013	J	`jnl`	A superpolynomial lower bound for strategy iteration based on snare memorization. Discret. Appl. Math. Oliver Friedmann
2013	J	`jnl`	An exponential lower bound for Cunningham's rule CoRR David Avis, Oliver Friedmann
2013	J	`jnl`	Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics Oliver Friedmann, Martin Lange
2013	J	`jnl`	Guarded Transformation for the Modal mu-Calculus CoRR Florian Bruse, Oliver Friedmann, Martin Lange
2013	—	`conf`	Ramsey Goes Visibly Pushdown. ICALP (2) Oliver Friedmann, Felix Klaedtke, Martin Lange
2013	J	`jnl`	Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. Oliver Friedmann, Markus Latte, Martin Lange
2012	A	`conf`	Ramsey-Based Analysis of Parity Automata. TACAS Oliver Friedmann, Martin Lange
2012	J	`jnl`	Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. Oliver Friedmann, Martin Lange
2011	B	`conf`	A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. IPCO Oliver Friedmann
2011	A*	`conf`	A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2011	J	`jnl`	An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms Log. Methods Comput. Sci. Oliver Friedmann
2011	—	`—`	Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs. Oliver Friedmann
2011	—	`ch.`	Exponentielle untere Schranken zur Lösung infinitärer Auszahlungsspiele und linearer Programme. Ausgezeichnete Informatikdissertationen Oliver Friedmann
2011	J	`jnl`	More on balanced diets. J. Funct. Program. Oliver Friedmann, Martin Lange
2011	J	`jnl`	Recursive algorithm for parity games requires exponential time. RAIRO Theor. Informatics Appl. Oliver Friedmann
2011	A*	`conf`	Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2011	B	`conf`	The Modal TABLEAUX Oliver Friedmann, Martin Lange
2010	A	`conf`	A Decision Procedure for CTL IJCAR Oliver Friedmann, Markus Latte, Martin Lange
2010	—	`conf`	Local Strategy Improvement for Parity Game Solving GANDALF Oliver Friedmann, Martin Lange
2010	J	`jnl`	The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time. Int. J. Found. Comput. Sci. Oliver Friedmann
2009	—	`conf`	A Solver for Modal Fixpoint Logics. M4M Oliver Friedmann, Martin Lange
2009	J	`jnl`	A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it CoRR Oliver Friedmann
2009	A*	`conf`	An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. LICS Oliver Friedmann
2009	B	`conf`	Solving Parity Games in Practice. ATVA Oliver Friedmann, Martin Lange

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.