Sabyasachi Basu

13 papers A* 2A 2Journal 9

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. WSDM Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2025	J	`jnl`	Aggregating maximal cliques in real-world graphs. CoRR Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2024	J	`jnl`	A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2024	A	`conf`	Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets. CIKM Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024	J	`jnl`	Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets. CoRR Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024	J	`jnl`	Spectral Triadic Decompositions of Real-World Networks. SIAM J. Math. Data Sci. Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2023	J	`jnl`	Optimal storage codes on graphs with fixed locality. CoRR Sabyasachi Basu, Manuj Mukherjee
2022	J	`jnl`	Spectral Triadic Decompositions of Real-World Networks. CoRR Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2022	A*	`conf`	The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021	J	`jnl`	The complexity of testing all properties of planar graphs, and the role of isomorphism. CoRR Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021	J	`jnl`	The complexity of testing all properties of planar graphs, and the role of isomorphism. Electron. Colloquium Comput. Complex. Sabyasachi Basu, Akash Kumar, C. Seshadhri
2007	J	`jnl`	Automatic outlier detection for time series: an application to sensor data. Knowl. Inf. Syst. Sabyasachi Basu, Martin Meckesheimer
1996	A*	`conf`	Time Series Models for Internet Traffic. INFOCOM Sabyasachi Basu, Amarnath Mukherjee, Steve Klivansky

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.