Ran Libeskind-Hadas

63 papers A* 3A 5B 5C 1Journal 38Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	ACM 2023: CS + X - Challenges and Opportunities in Developing Interdisciplinary-Computing Curricula. Inroads Carla E. Brodley, Valerie Barr, Elsa Gunter, Mark Guzdial, Ran Libeskind-Hadas, Bill Z. Manaris
2024	J	`jnl`	Pairwise Distances and the Problem of Multiple Optima. J. Comput. Biol. Ran Libeskind-Hadas
2023	J	`jnl`	xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes. BMC Bioinform. Nuo Liu, Tonatiuh A. Gonzalez, Jacob Fischer, Chan Hong, Michelle Johnson, Ross Mawhorter, Fabrizia Mugnatto, Rachael Soh, Shifa Somji, Joseph S. Wirth, Ran Libeskind-Hadas, Eliot C. Bush
2022	J	`jnl`	A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks. IEEE ACM Trans. Comput. Biol. Bioinform. Matthew LeMay, Ran Libeskind-Hadas, Yi-Chieh Wu
2022	—	`conf`	Distance Profiles of Optimal RNA Foldings. ISBRA Jingyi Liu, I. Duan, Santi Santichaivekin, Ran Libeskind-Hadas
2021	A	`conf`	A Biology-based CS1: Results and Reflections, Ten Years In. SIGCSE Zachary Dodds, Malia Morgan, Lindsay Popowski, Henry Coxe, Caroline Coxe, Kewei Zhou, Eliot C. Bush, Ran Libeskind-Hadas
2021	J	`jnl`	Maximum parsimony reconciliation in the DTLOR model. BMC Bioinform. Jingyi Liu, Ross Mawhorter, Nuo Liu, Santi Santichaivekin, Eliot C. Bush, Ran Libeskind-Hadas
2021	J	`jnl`	Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. IEEE ACM Trans. Comput. Biol. Bioinform. Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, Yi-Chieh Wu
2021	J	`jnl`	Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. Melissa Grueter, Kalani Duran, Ramya Ramalingam, Ran Libeskind-Hadas
2021	C	`conf`	The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. WABI Matthew LeMay, Yi-Chieh Wu, Ran Libeskind-Hadas
2021	J	`jnl`	eMPRess: a systematic cophylogeny reconciliation tool. Bioinform. Santi Santichaivekin, Qing Yang, Jingyi Liu, Ross Mawhorter, Justin Jiang, Trenton Wesley, Yi-Chieh Wu, Ran Libeskind-Hadas
2020	A	`conf`	CS + X Meets CS 1: Strongly Themed Intro Courses. SIGCSE Robert H. Sloan, Valerie Barr, Heather Bort, Mark Guzdial, Ran Libeskind-Hadas, Richard Warner
2020	J	`jnl`	Computer-Aided Personalized Education. CoRR Rajeev Alur, Richard G. Baraniuk, Rastislav Bodík, Ann W. Drobnis, Sumit Gulwani, Bjoern Hartmann, Yasmin B. Kafai, Jeff Karpicke, Ran Libeskind-Hadas, Debra J. Richardson, Armando Solar-Lezama, Candace Thille, Moshe Y. Vardi
2019	J	`jnl`	An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. BMC Bioinform. Santi Santichaivekin, Ross Mawhorter, Ran Libeskind-Hadas
2019	J	`jnl`	Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. Jordan Haack, Eli Zupke, Andrew Ramirez, Yi-Chieh Wu, Ran Libeskind-Hadas
2019	J	`jnl`	Hierarchical clustering of maximum parsimony reconciliations. BMC Bioinform. Ross Mawhorter, Ran Libeskind-Hadas
2019	J	`jnl`	Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model. BMC Bioinform. Ross Mawhorter, Nuo Liu, Ran Libeskind-Hadas, Yi-Chieh Wu
2018	J	`jnl`	DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations. IEEE ACM Trans. Comput. Biol. Bioinform. Weiyun Ma, Dmitriy Smirnov, Juliet Forman, A. Schweickart, C. Slocum, S. Srinivasan, Ran Libeskind-Hadas
2018	—	`conf`	Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model. AlCoB Ricson Cheng, Matthew Dohlen, Chen Pekker, Gabriel Quiroz, Jincheng Wang, Ran Libeskind-Hadas, Yi-Chieh Wu
2017	—	`conf`	Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. AlCoB Alex Ozdemir, Michael Sheely, Daniel Bork, Ricson Cheng, Reyna Hulett, Jean Sung, Jincheng Wang, Ran Libeskind-Hadas
2017	J	`jnl`	DTL reconciliation repair. BMC Bioinform. Weiyun Ma, Dmitriy Smirnov, Ran Libeskind-Hadas
2017	J	`jnl`	On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithms Mol. Biol. Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, Ran Libeskind-Hadas
2015	J	`jnl`	Biologically motivated problems for introductory computer science: conference tutorial. J. Comput. Sci. Coll. Eliot C. Bush, Ran Libeskind-Hadas
2015	—	`conf`	CRA-E Panel on Undergraduate Research. CSCW Companion Nancy M. Amato, Ran Libeskind-Hadas, Panagiotis Takis Metaxas
2015	J	`jnl`	The PhD Pipeline. Computer Susanne E. Hambrusch, Ran Libeskind-Hadas
2015	J	`jnl`	Understanding the U.S. domestic computer science Ph.D. pipeline. Commun. ACM Susanne E. Hambrusch, Ran Libeskind-Hadas, Eric Aaron
2014	J	`jnl`	Pareto-optimal phylogenetic tree reconciliation. Bioinform. Ran Libeskind-Hadas, Yi-Chieh Wu, Mukul S. Bansal, Manolis Kellis
2013	A	`conf`	A derivation-first approach to teaching algorithms. SIGCSE Ran Libeskind-Hadas
2013	J	`jnl`	A first course in computing with applications to biology. Briefings Bioinform. Ran Libeskind-Hadas, Eliot C. Bush
2013	A	`conf`	Making the most of undergraduate research (abstract only). SIGCSE Andrea Danyluk, Nancy M. Amato, Ran Libeskind-Hadas, Lori L. Pollock, Susan H. Rodger
2012	B	`conf`	Bio1 as CS1: evaluating a crossdisciplinary CS context. ITiCSE Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush
2012	J	`jnl`	Increasing women's participation in computing at Harvey Mudd College. Inroads Christine Alvarado, Zachary Dodds, Ran Libeskind-Hadas
2011	J	`jnl`	Pixels as polymers: unifying introductory biology and computer science through visual computation. J. Comput. Sci. Coll. Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush
2011	J	`jnl`	The Cophylogeny Reconstruction Problem Is NP-Complete. J. Comput. Biol. Yaniv Ovadia, Daniel Fielder, Chris Conow, Ran Libeskind-Hadas
2010	J	`jnl`	Jane: a new tool for the cophylogeny reconstruction problem. Algorithms Mol. Biol. Chris Conow, Daniel Fielder, Yaniv Ovadia, Ran Libeskind-Hadas
2010	B	`conf`	When CS 1 is biology 1: crossdisciplinary collaboration as CS context. ITiCSE Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush
2009	—	`conf`	Approximation Algorithms for Traffic Grooming in WDM Rings. ICC Kevin Corcoran, Seth R. Flaxman, Mark Neyer, Peter Scherpelz, Craig Weidert, Ran Libeskind-Hadas
2009	J	`jnl`	On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem. J. Comput. Biol. Ran Libeskind-Hadas, Michael A. Charleston
2008	J	`jnl`	Competitive analysis of online traffic grooming in WDM rings. IEEE/ACM Trans. Netw. Karyn Benson, Benjamin E. Birnbaum, Esteban Molina-Estolano, Ran Libeskind-Hadas
2008	A	`conf`	Evaluating a breadth-first cs 1 for scientists. SIGCSE Zachary Dodds, Ran Libeskind-Hadas, Christine Alvarado, Geoff Kuenning
2007	B	`conf`	Breadth-first CS 1 for scientists. ITiCSE Zachary Dodds, Christine Alvarado, Geoff Kuenning, Ran Libeskind-Hadas
2006	J	`jnl`	Virtual topologies for multicasting with multiple originators in WDM networks. IEEE/ACM Trans. Netw. Ian Ferrel, Adrian Mettler, Edward Miller, Ran Libeskind-Hadas
2005	—	`conf`	Traffic grooming for single-source multicast communication in WDM rings. ICC David Buchfuhrer, Timothy Carnes, Brian Tagiku, Laura Celis, Ran Libeskind-Hadas
2004	J	`jnl`	On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches. IEEE J. Sel. Areas Commun. Edward Miller, Ran Libeskind-Hadas, D. Barnard, W. Chang, Kurt M. Dresner, W. M. Turner, Jeffrey R. K. Hartline
2004	J	`jnl`	Optimal virtual topologies for one-to-many communication in WDM paths and rings. IEEE/ACM Trans. Netw. Jeffrey R. K. Hartline, Ran Libeskind-Hadas, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray
2003	J	`jnl`	The Computational Complexity of Motion Planning. SIAM Rev. Jeffrey R. K. Hartline, Ran Libeskind-Hadas
2002	J	`jnl`	Multicast routing and wavelength assignment in multihop optical networks. IEEE/ACM Trans. Netw. Ran Libeskind-Hadas, Rami G. Melhem
2002	B	`conf`	Multicast virtual topologies in WDM paths and rings with splitting loss. ICCCN Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray
2001	—	`conf`	Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks. ICN (1) Ran Libeskind-Hadas, Rami G. Melhem
2001	J	`jnl`	On Multicast Algorithms for Heterogeneous Networks of Workstations. J. Parallel Distributed Comput. Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Peter Boothe, Greg Rae, Jascha Swisher
2000	—	`conf`	Efficient Multicast in Heterogeneous Networks of Workstations. ICPP Workshops Ran Libeskind-Hadas, Jeffrey R. K. Hartline
2000	B	`conf`	Efficient collective communication in WDM networks with a power budget. ICCCN Ran Libeskind-Hadas
1999	J	`jnl`	On Edge-Disjoint Spanning Trees in Hypercubes. Inf. Process. Lett. Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams
1998	J	`jnl`	A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Trans. Computers Ran Libeskind-Hadas
1998	—	`conf`	Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations. IPPS/SPDP Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
1998	—	`conf`	Tree-Based Multicasting in Wormhole-Routed Irregular Topologies. IPPS/SPDP Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
1996	A*	`conf`	Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels. HPCA Ran Libeskind-Hadas, Kevin Watkins, Thomas Hehre
1995	J	`jnl`	Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays. IEEE Trans. Parallel Distributed Syst. Ran Libeskind-Hadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu
1995	A*	`conf`	Origin-Based Fault-Tolerant routing in the Mesh. HPCA Ran Libeskind-Hadas, Eli Brandt
1995	J	`jnl`	Origin-based fault-tolerant routing in the mesh. Future Gener. Comput. Syst. Ran Libeskind-Hadas, Eli Brandt
1993	—	`—`	Reconfiguration of Fault-Tolerant VLSI Systems Ran Libeskind-Hadas
1991	J	`jnl`	Disjoint Covers in Replicated Heterogeneous Arrays. SIAM J. Discret. Math. Philip K. McKinley, Nany Hasan, Ran Libeskind-Hadas, C. L. Liu
1989	A*	`conf`	Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks. DAC Ran Libeskind-Hadas, C. L. Liu

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.