Panagiota N. Panagopoulou

27 papers A* 1B 6Misc 2Journal 8Unranked 8

Year	Rank	Type	Title / Venue / Authors
2018	—	`conf`	Simple algorithmic techniques to approximate nash equilibria. PCI Panagiota N. Panagopoulou
2015	—	`conf`	Efficient Equilibrium Concepts in Non-cooperative Network Formation. Algorithms, Probability, Networks, and Games Panagiota N. Panagopoulou
2015	J	`jnl`	On the structure of equilibria in basic network formation. Theor. Comput. Sci. Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis
2015	—	`conf`	Rationality Authority for Provable Rational Behavior. Algorithms, Probability, Networks, and Games Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis
2014	J	`jnl`	Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Theory Comput. Syst. Panagiota N. Panagopoulou, Paul G. Spirakis
2013	B	`conf`	On the Structure of Equilibria in Basic Network Formation. FCT Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis
2013	J	`jnl`	On the Structure of Equilibria in Basic Network Formation. CoRR Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis
2013	Misc	`conf`	Potential Functions in Strategic Games. CSR Paul G. Spirakis, Panagiota N. Panagopoulou
2012	J	`jnl`	Playing a Game to Bound the Chromatic Number. Am. Math. Mon. Panagiota N. Panagopoulou, Paul G. Spirakis
2011	B	`conf`	Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). SAGT Panagiota N. Panagopoulou, Paul G. Spirakis
2011	A*	`conf`	Rationality authority for provable rational behavior. PODC Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis
2010	B	`conf`	Distributed Game-Theoretic Vertex Coloring. OPODIS Ioannis Chatzigiannakis, Christos Koninis, Panagiota N. Panagopoulou, Paul G. Spirakis
2010	Misc	`conf`	Fun with Games. FUN Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou
2009	J	`jnl`	Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis
2008	B	`conf`	A Game Theoretic Approach for Efficient Graph Coloring. ISAAC Panagiota N. Panagopoulou, Paul G. Spirakis
2008	—	`ch.`	Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis
2008	J	`jnl`	Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2008	—	`—`	Αλγοριθμική και εξελικτική θεωρία παιγνίων Panagiota N. Panagopoulou
2007	B	`conf`	Full and Local Information in Distributed Decision Making. WAOA Panagiota N. Panagopoulou, Paul G. Spirakis
2007	B	`conf`	Selfish Load Balancing Under Partial Knowledge. MFCS Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis
2006	J	`jnl`	Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics Panagiota N. Panagopoulou, Paul G. Spirakis
2006	—	`conf`	Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis
2006	J	`jnl`	Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electron. Colloquium Comput. Complex. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis
2005	—	`conf`	A Cost Mechanism for Fair Pricing of Resource Usage. Algorithmic Aspects of Large and Complex Networks Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005	—	`conf`	A Cost Mechanism for Fair Pricing of Resource Usage. WINE Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005	—	`conf`	Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Algorithmic Aspects of Large and Complex Networks Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005	—	`conf`	Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. WEA Panagiota N. Panagopoulou, Paul G. Spirakis

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.