Tanya Khovanova

23 papers Journal 23

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Permutation-based Strategies for Labeled Chip-Firing on $k$-ary Trees. Discret. Math. Theor. Comput. Sci. Ryota Inagaki, Tanya Khovanova, Austin Luo
2025	J	`jnl`	Archive Labeling Sequences. Am. Math. Mon. Tanya Khovanova, Gregory Marton
2025	J	`jnl`	Combinatorial aspects of the card game War. Australas. J Comb. Tanya Khovanova, Atharva Pathak
2025	J	`jnl`	EvenQuads Game and Error-Correcting Codes. SN Comput. Sci. Nikhil Byrapuram, Hwiseo Choi, Adam Ge, Selena Ge, Sylvia Zia Lee, Evin Liang, Rajarshi Mandal, Aika Oki, Daniel Wu, Michael Yang, Tanya Khovanova
2021	J	`jnl`	Limit Densities of Patterns in Permutation Inflations. Electron. J. Comb. Tanya Khovanova, Eric Zhang
2020	J	`jnl`	The No-Flippancy Game. CoRR Isha Agarwal, Matvey Borodin, Aidan Duncan, Kaylee Ji, Tanya Khovanova, Shane Lee, Boyan Litchev, Anshul Rastogi, Garima Rastogi, Andrew Zhao
2020	J	`jnl`	Variants of Base 3 Over 2. J. Integer Seq. Matvey Borodin, Hannah Han, Kaylee Ji, Alexander Peng, David Sun, Isabel Tu, Jason Yang, William Yang, Kevin Zhang, Kevin Zhao, Tanya Khovanova
2018	J	`jnl`	Coins and Logic. CoRR Tanya Khovanova
2017	J	`jnl`	P-positions in modular extensions to Nim. Int. J. Game Theory Tanya Khovanova, Karan Sarkar
2016	J	`jnl`	Chocolate Numbers. J. Integer Seq. Caleb Ji, Tanya Khovanova, Robin Park, Angela Song
2015	J	`jnl`	On k-visibility graphs. J. Graph Algorithms Appl. Matthew Babbitt, Jesse Geneson, Tanya Khovanova
2015	J	`jnl`	Weighing Coins and Keeping Secrets. CoRR Nicholas Diaco, Tanya Khovanova
2014	J	`jnl`	Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs. Discret. Math. Jesse Geneson, Tanya Khovanova, Jonathan Tidor
2014	J	`jnl`	Free Fibonacci Sequences. J. Integer Seq. Brandon Avila, Tanya Khovanova
2014	J	`jnl`	Nim Fractals. J. Integer Seq. Tanya Khovanova, Joshua Xiong
2013	J	`jnl`	Efficient Calculation of Determinants of Symbolic Matrices with Many Variables CoRR Tanya Khovanova, Ziv Scully
2013	J	`jnl`	On k-visibility graphs CoRR Matthew Babbitt, Jesse Geneson, Tanya Khovanova
2012	J	`jnl`	Halving Lines and Their Underlying Graphs CoRR Tanya Khovanova, Dai Yang
2012	J	`jnl`	Killer Problems. Am. Math. Mon. Tanya Khovanova, Alexey Radul
2012	J	`jnl`	Sequences of integers with missing quotients and dense points without neighbors. Discret. Math. Tanya Khovanova, Sergei Konyagin
2011	J	`jnl`	Baron Münchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle. Electron. J. Comb. Tanya Khovanova, Joel Brewster Lewis
2010	J	`jnl`	Baron Munchhausen's Sequence CoRR Tanya Khovanova, Konstantin Knop, Alexey Radul
2005	J	`jnl`	A Detailed Study of the Attachment Strategies of New Autonomous Systems in the AS Connectivity Graph. Internet Math. Ingrid Daubechies, Konstantinos Drakakis, Tanya Khovanova

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.