Aayush Rajasekaran

12 papers A 1B 2Journal 7Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	From Indexing to Coding: A New Paradigm for Data Availability Sampling. CoRR Moritz Grundei, Aayush Rajasekaran, Kishori M. Konwar, Muriel Médard
2025	J	`jnl`	OPTIMUMP2P: Fast and Reliable Gossiping in P2P Networks. CoRR Nicolas Nicolaou, Onyeka Obi, Aayush Rajasekaran, Alejandro Bergasov, Aleksandr Bezobchuk, Kishori M. Konwar, Michael Meier, Santiago Paiva, Har Preet Singh, Swarnabha Sinha, Sriram Vishwanath, Muriel Médard
2025	B	`conf`	OptimumP2P: Fast and Reliable Gossiping in P2P Networks. CNSM Nicolas Nicolaou, Onyeka Obi, Aayush Rajasekaran, Alejandro Bergasov, Aleksandr Bezobchuk, Kishori M. Konwar, Michael Meier, Santiago Paiva, Har Preet Singh, Swarnabha Sinha, Sriram Vishwanath, Muriel Médard
2020	J	`jnl`	Additive Number Theory via Automata Theory. Theory Comput. Syst. Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2019	J	`jnl`	An Interleaving Hybrid Consensus Protocol. CoRR Yao Sun, Aayush Rajasekaran
2018	B	`conf`	Lagrange's Theorem for Binary Squares. MFCS P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit
2018	A	`conf`	Sums of Palindromes: an Approach via Automata. STACS Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2017	J	`jnl`	Lagrange's Theorem for Binary Squares. CoRR Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit
2017	—	`conf`	Overpals, Underlaps, and Underpals. WORDS Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit
2017	J	`jnl`	Sums of Palindromes: an Approach via Nested-Word Automata. CoRR Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2016	—	`conf`	On the State Complexity of the Shuffle of Regular Languages. DCFS Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
2015	J	`jnl`	On the State Complexity of the Shuffle of Regular Languages. CoRR Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula

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.