Ran Libeskind-Hadas

Ran Libeskind-Hadas's AcademicInfluence.com Rankings

Ran Libeskind-Hadas

Computer Science

#3663

World Rank

#3849

Historical Rank

#1350

USA Rank

Database

#7185

World Rank

#7433

Historical Rank

#847

USA Rank

computer-science Degrees

Download Badge

Computer Science

Ran Libeskind-Hadas's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley
Bachelors Computer Science Princeton University

Similar Degrees You Can Earn

Why Is Ran Libeskind-Hadas Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ran Libeskind-Hadas is the founding chair of the Department of Integrated Sciences at Claremont McKenna College. He was previously a professor of computer science at Harvey Mudd College where he served as chair of that department and associate dean of faculty. His research interests lie in the area of algorithms for computational biology.

(See a Problem?)

Ran Libeskind-Hadas's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Jane: a new tool for the cophylogeny reconstruction problem (2010) (354)
An Extreme Case of Plant–Insect Codiversification: Figs and Fig-Pollinating Wasps (2012) (289)
Increasing women's participation in computing at Harvey Mudd College (2012) (116)
Discordant phylogenies suggest repeated host shifts in the Fusarium-Euwallacea ambrosia beetle mutualism. (2015) (114)
The Cophylogeny Reconstruction Problem Is NP-Complete (2011) (82)
Multicast routing and wavelength assignment in multihop optical networks (2002) (79)
On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem (2009) (79)
Pareto-optimal phylogenetic tree reconciliation (2014) (57)
On Multicast Algorithms for Heterogeneous Networks of Workstations (1989) (49)
Origin-based fault-tolerant routing in the mesh (1995) (48)
On Edge-Disjoint Spanning Trees in Hypercubes (1999) (44)
Invasive Asian Fusarium – Euwallacea ambrosia beetle mutualists pose a serious threat to forests, urban landscapes and the avocado industry (2016) (42)
Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks (1989) (40)
Evaluating a breadth-first cs 1 for scientists (2008) (38)
Efficient collective communication in WDM networks with a power budget (2000) (35)
Tree-based multicasting in wormhole-routed irregular topologies (1998) (30)
eMPRess: a systematic cophylogeny reconciliation tool (2020) (27)
When CS 1 is biology 1: crossdisciplinary collaboration as CS context (2010) (26)
A first course in computing with applications to biology (2013) (25)
Fast search algorithms for reconfiguration problems (1991) (21)
Optimal contention-free unicast-based multicasting in switch-based networks of workstations (1998) (21)
Fault-tolerant multicast routing in the mesh with no virtual channels (1996) (20)
Event-Based Cophylogenetic Comparative Analysis (2014) (17)
Breadth-first CS 1 for scientists (2007) (17)
Application Of Iterated Function Systems And Skeletonization To Synthesis Of Fractal Images (1987) (15)
Virtual topologies for multicasting with multiple originators in WDM networks (2006) (14)
Bio1 as CS1: evaluating a crossdisciplinary CS context (2012) (14)
Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks (2001) (13)
DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations (2018) (12)
The Computational Complexity of Motion Planning (2003) (12)
Approximation Algorithms for Traffic Grooming in WDM Rings (2009) (11)
Hierarchical clustering of maximum parsimony reconciliations (2019) (11)
HMC CS Technical Report CS-2011-1: Faster Dynamic Programming Algorithms for the Cophylogeny Reconstruction Problem (2011) (11)
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model (2017) (9)
Multicast virtual topologies in WDM paths and rings with splitting loss (2002) (9)
Optimal virtual topologies for one-to-many communication in WDM paths and rings (2004) (9)
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model (2019) (8)
Efficient multicast in heterogeneous networks of workstations (2000) (8)
Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model (2019) (8)
On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches (2004) (7)
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model (2019) (7)
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays (1995) (7)
Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model (2017) (7)
DTL reconciliation repair (2017) (7)
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model (2019) (6)
Computing for Biologists: Python Programming and Principles (2014) (6)
Sorting in Parallel (1998) (6)
A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing (1998) (6)
Competitive Analysis of Online Traffic Grooming in WDM Rings (2008) (6)
Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model (2019) (5)
Fault covering problems in reconfigurable VLSI systems (1992) (5)
Figs, Wasps, Gophers, and Lice: A Computational Exploration of Coevolution (2010) (5)
CS + X Meets CS 1: Strongly Themed Intro Courses (2020) (4)
A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks (2020) (4)
Disjoint Covers in Replicated Heterogeneous Arrays (1991) (4)
Understanding the U.S. domestic computer science Ph.D. pipeline (2015) (4)
Computer-Aided Personalized Education (2020) (3)
Approximation Algorithms: Good Solutions to Hard Problems (1995) (3)
Efficient bi-level reconfiguration algorithms for fault tolerant arrays (1992) (3)
Adaptive Multicast Routing in Wormhole Networks (1997) (3)
Exploring the Baccalaureate Origin of Domestic Ph.D. Students in Computing Fields (2013) (3)
A derivation-first approach to teaching algorithms (2013) (2)
Reconfiguration of fault tolerant VLSI systems (1993) (2)
The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard (2021) (2)
Traffic grooming for single-source multicast communication in WDM rings (2005) (2)
Tree Reconciliation Methods for Host-Symbiont Cophylogenetic Analyses (2022) (2)
Using Neural Networks to Solve VLSI Design Problems (1989) (1)
A Biology-based CS1: Results and Reflections, Ten Years In (2021) (1)
A Tight Bound on the Number of Channel Faults inWormhole-Routed Multicomputers (1995) (1)
Multicast Communication in Circuit-Switched Optical Networks (2001) (1)
Computing for Biologists by Ran Libeskind-Hadas (2014) (1)
Pixels as polymers: unifying introductory biology and computer science through visual computation (2011) (1)
Matroids : The Theory and Practice of Greed (2002) (1)
Applications of Kolmogorov Complexity to Graphs (2005) (1)
The UPGMA Algorithm (2014) (0)
Maximum parsimony reconciliation in the DTLOR model (2021) (0)
Optimal Contention-Free Unicast-Based Multicasting i Networks of Workstations* (1998) (0)
Distance Profiles of Optimal RNA Foldings (2022) (0)
The PhD Pipeline (2015) (0)
Pareto-optimal phylogenetic tree reconciliation Citation (2014) (0)
Dictionaries, Memoization, and Speed (2014) (0)
Sequence Alignment and Sex Determination (2014) (0)
Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model (2018) (0)
Biologically motivated problems for introductory computer science: conference tutorial (2015) (0)
General Formulation of Fault Covering Problems (1992) (0)
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model (2017) (0)
Open Reading Frames and Genes (2014) (0)
Sequence Alignment and the Evolution of Sex Chromosomes (2014) (0)
Phylogenetic Reconstruction and the Origin of Modern Humans (2014) (0)
Fault Covers in Rectangular Arrays (1992) (0)
RNA Secondary Structure Prediction (2014) (0)
Where to go from here (2014) (0)
Gene Regulatory Networks and the Maximum Likelihood Method (2014) (0)
Representing and Working with Trees (2014) (0)
Fault Covers in Heterogeneous and General Arrays (1992) (0)
Invasive Asian Fusarium – Euwallacea ambrosia beetle mutualists pose a serious threat to forests, urban landscapes and the avocado industry (2016) (0)
DTL reconciliation repair (2017) (0)
Breaking Boundaries in Computing in Undergraduate Courses (2018) (0)
Computing GC Content (2014) (0)
Birds, Bees, and Genetic Algorithms (2014) (0)
Python versus Pathogens (2014) (0)
CRA-E Panel on Undergraduate Research (2015) (0)
Making the most of undergraduate research (abstract only) (2013) (0)
Hierarchical clustering of maximum parsimony reconciliations (2019) (0)
Proof Without Words: The Pigeonhole Principle (2002) (0)

This paper list is powered by the following services:

Other Resources About Ran Libeskind-Hadas

What Schools Are Affiliated With Ran Libeskind-Hadas?

Ran Libeskind-Hadas is affiliated with the following schools:

Ran Libeskind-Hadas's Academic­Influence.com Rankings