Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Libeskind-Hadas
Person information
- affiliation: Harvey Mudd College, Claremont, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1993
[b1]Ran Libeskind-Hadas:
Reconfiguration of Fault-Tolerant VLSI Systems. University of Illinois Urbana-Champaign, USA, 1993
Journal Articles
- 2023
- [j33]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
:
xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes. BMC Bioinform. 24(1): 295 (2023) - 2022
- [j32]Matthew LeMay, Ran Libeskind-Hadas, Yi-Chieh Wu:
A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 19(5): 2642-2653 (2022) - 2021
- [j31]Santi Santichaivekin, Qing Yang, Jingyi Liu, Ross Mawhorter, Justin Jiang, Trenton Wesley, Yi-Chieh Wu, Ran Libeskind-Hadas:
eMPRess: a systematic cophylogeny reconciliation tool. Bioinform. 37(16): 2481-2482 (2021) - [j30]Jingyi Liu, Ross Mawhorter, Nuo Liu, Santi Santichaivekin, Eliot C. Bush, Ran Libeskind-Hadas:
Maximum parsimony reconciliation in the DTLOR model. BMC Bioinform. 22(10): 394 (2021) - [j29]Melissa Grueter, Kalani Duran, Ramya Ramalingam, Ran Libeskind-Hadas:
Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2136-2143 (2021) - [j28]Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, Yi-Chieh Wu:
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2144-2156 (2021) - 2019
- [j27]Ross Mawhorter, Ran Libeskind-Hadas:
Hierarchical clustering of maximum parsimony reconciliations. BMC Bioinform. 20(1): 612:1-612:12 (2019) - [j26]Santi Santichaivekin, Ross Mawhorter, Ran Libeskind-Hadas:
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. BMC Bioinform. 20-S(20): 636 (2019) - [j25]Ross Mawhorter, Nuo Liu, Ran Libeskind-Hadas, Yi-Chieh Wu:
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model. BMC Bioinform. 20-S(20): 639 (2019) - [j24]Jordan Haack, Eli Zupke, Andrew Ramirez, Yi-Chieh Wu, Ran Libeskind-Hadas:
Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 14-22 (2019) - 2018
- [j23]Weiyun Ma, Dmitriy Smirnov, Juliet Forman, A. Schweickart, C. Slocum, S. Srinivasan, Ran Libeskind-Hadas:
DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 411-421 (2018) - 2017
- [j22]Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, Ran Libeskind-Hadas:
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithms Mol. Biol. 12(1): 6:1-6:12 (2017) - [j21]Weiyun Ma, Dmitriy Smirnov, Ran Libeskind-Hadas:
DTL reconciliation repair. BMC Bioinform. 18(S-3): 13-21 (2017) - 2015
- [j20]Susanne E. Hambrusch, Ran Libeskind-Hadas, Eric Aaron:
Understanding the U.S. domestic computer science Ph.D. pipeline. Commun. ACM 58(8): 29-32 (2015) - [j19]Susanne E. Hambrusch, Ran Libeskind-Hadas:
The PhD Pipeline. Computer 48(5): 76-79 (2015) - 2014
- [j18]Ran Libeskind-Hadas, Yi-Chieh Wu, Mukul S. Bansal, Manolis Kellis:
Pareto-optimal phylogenetic tree reconciliation. Bioinform. 30(12): 87-95 (2014) - 2013
- [j17]Ran Libeskind-Hadas, Eliot C. Bush:
A first course in computing with applications to biology. Briefings Bioinform. 14(5): 610-617 (2013) - 2012
- [j16]Christine Alvarado, Zachary Dodds, Ran Libeskind-Hadas:
Increasing women's participation in computing at Harvey Mudd College. Inroads 3(4): 55-64 (2012) - 2011
- [j15]Yaniv Ovadia, Daniel Fielder, Chris Conow, Ran Libeskind-Hadas:
The Cophylogeny Reconstruction Problem Is NP-Complete. J. Comput. Biol. 18(1): 59-65 (2011) - 2010
- [j14]Chris Conow, Daniel Fielder, Yaniv Ovadia, Ran Libeskind-Hadas:
Jane: a new tool for the cophylogeny reconstruction problem. Algorithms Mol. Biol. 5: 16 (2010) - 2009
- [j13]Ran Libeskind-Hadas, Michael A. Charleston:
On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem. J. Comput. Biol. 16(1): 105-117 (2009) - 2008
- [j12]Karyn Benson, Benjamin E. Birnbaum, Esteban Molina-Estolano, Ran Libeskind-Hadas:
Competitive analysis of online traffic grooming in WDM rings. IEEE/ACM Trans. Netw. 16(4): 984-997 (2008) - 2006
- [j11]Ian Ferrel, Adrian Mettler, Edward Miller, Ran Libeskind-Hadas:
Virtual topologies for multicasting with multiple originators in WDM networks. IEEE/ACM Trans. Netw. 14(1): 183-190 (2006) - 2004
- [j10]Edward Miller, Ran Libeskind-Hadas, D. Barnard, W. Chang, Kurt M. Dresner, W. M. Turner, Jeffrey R. K. Hartline:
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. 22(9): 1601-1612 (2004) - [j9]Jeffrey R. K. Hartline, Ran Libeskind-Hadas, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray:
Optimal virtual topologies for one-to-many communication in WDM paths and rings. IEEE/ACM Trans. Netw. 12(2): 375-383 (2004) - 2003
- [j8]Jeffrey R. K. Hartline, Ran Libeskind-Hadas:
The Computational Complexity of Motion Planning. SIAM Rev. 45(3): 543-557 (2003) - 2002
- [j7]Ran Libeskind-Hadas, Rami G. Melhem:
Multicast routing and wavelength assignment in multihop optical networks. IEEE/ACM Trans. Netw. 10(5): 621-629 (2002) - 2001
- [j6]Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Peter Boothe, Greg Rae, Jascha Swisher:
On Multicast Algorithms for Heterogeneous Networks of Workstations. J. Parallel Distributed Comput. 61(11): 1665-1679 (2001) - 1999
- [j5]Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams:
On Edge-Disjoint Spanning Trees in Hypercubes. Inf. Process. Lett. 70(1): 13-16 (1999) - 1998
- [j4]Ran Libeskind-Hadas:
A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Trans. Computers 47(10): 1158-1160 (1998) - 1995
- [j3]Ran Libeskind-Hadas, Eli Brandt:
Origin-based fault-tolerant routing in the mesh. Future Gener. Comput. Syst. 11(6): 603-615 (1995) - [j2]Ran Libeskind-Hadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu:
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays. IEEE Trans. Parallel Distributed Syst. 6(5): 498-511 (1995) - 1991
- [j1]Philip K. McKinley, Nany Hasan, Ran Libeskind-Hadas, C. L. Liu:
Disjoint Covers in Replicated Heterogeneous Arrays. SIAM J. Discret. Math. 4(2): 281-292 (1991)
Conference and Workshop Papers
- 2022
- [c24]Jingyi Liu, I. Duan, Santi Santichaivekin, Ran Libeskind-Hadas:
Distance Profiles of Optimal RNA Foldings. ISBRA 2022: 315-329 - 2021
- [c23]Zachary Dodds, Malia Morgan, Lindsay Popowski, Henry Coxe, Caroline Coxe, Kewei Zhou, Eliot C. Bush, Ran Libeskind-Hadas:
A Biology-based CS1: Results and Reflections, Ten Years In. SIGCSE 2021: 796-801 - [c22]Matthew LeMay, Yi-Chieh Wu, Ran Libeskind-Hadas:
The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. WABI 2021: 1:1-1:10 - 2020
- [c21]Robert H. Sloan, Valerie Barr, Heather Bort, Mark Guzdial, Ran Libeskind-Hadas, Richard Warner:
CS + X Meets CS 1: Strongly Themed Intro Courses. SIGCSE 2020: 960-961 - 2018
- [c20]Ricson Cheng, Matthew Dohlen, Chen Pekker, Gabriel Quiroz, Jincheng Wang, Ran Libeskind-Hadas, Yi-Chieh Wu:
Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model. AlCoB 2018: 11-23 - 2017
- [c19]Alex Ozdemir, Michael Sheely, Daniel Bork, Ricson Cheng, Reyna Hulett, Jean Sung, Jincheng Wang, Ran Libeskind-Hadas:
Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. AlCoB 2017: 127-139 - 2015
- [c18]Nancy M. Amato, Ran Libeskind-Hadas, Panagiotis Takis Metaxas:
CRA-E Panel on Undergraduate Research. CSCW Companion 2015: 113-115 - 2013
- [c17]Ran Libeskind-Hadas:
A derivation-first approach to teaching algorithms. SIGCSE 2013: 573-578 - [c16]Andrea Danyluk, Nancy M. Amato, Ran Libeskind-Hadas, Lori L. Pollock, Susan H. Rodger:
Making the most of undergraduate research (abstract only). SIGCSE 2013: 758 - 2012
- [c15]Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush:
Bio1 as CS1: evaluating a crossdisciplinary CS context. ITiCSE 2012: 268-272 - 2010
- [c14]Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush:
When CS 1 is biology 1: crossdisciplinary collaboration as CS context. ITiCSE 2010: 219-223 - 2009
- [c13]Kevin Corcoran, Seth R. Flaxman, Mark Neyer, Peter Scherpelz, Craig Weidert, Ran Libeskind-Hadas:
Approximation Algorithms for Traffic Grooming in WDM Rings. ICC 2009: 1-6 - 2008
- [c12]Zachary Dodds, Ran Libeskind-Hadas, Christine Alvarado, Geoff Kuenning:
Evaluating a breadth-first cs 1 for scientists. SIGCSE 2008: 266-270 - 2007
- [c11]Zachary Dodds, Christine Alvarado, Geoff Kuenning, Ran Libeskind-Hadas:
Breadth-first CS 1 for scientists. ITiCSE 2007: 23-27 - 2005
- [c10]David Buchfuhrer, Timothy Carnes, Brian Tagiku, Laura Celis, Ran Libeskind-Hadas:
Traffic grooming for single-source multicast communication in WDM rings. ICC 2005: 1613-1619 - 2002
- [c9]Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray:
Multicast virtual topologies in WDM paths and rings with splitting loss. ICCCN 2002: 318-321 - 2001
- [c8]Ran Libeskind-Hadas, Rami G. Melhem:
Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks. ICN (1) 2001: 508-519 - 2000
- [c7]Ran Libeskind-Hadas:
Efficient collective communication in WDM networks with a power budget. ICCCN 2000: 612-616 - [c6]Ran Libeskind-Hadas, Jeffrey R. K. Hartline:
Efficient Multicast in Heterogeneous Networks of Workstations. ICPP Workshops 2000: 403-410 - 1998
- [c5]Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan:
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies. IPPS/SPDP 1998: 244-249 - [c4]Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan:
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations. IPPS/SPDP 1998: 358-364 - 1996
- [c3]Ran Libeskind-Hadas, Kevin Watkins, Thomas Hehre:
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels. HPCA 1996: 180-190 - 1995
- [c2]Ran Libeskind-Hadas, Eli Brandt:
Origin-Based Fault-Tolerant routing in the Mesh. HPCA 1995: 102-111 - 1989
- [c1]Ran Libeskind-Hadas, C. L. Liu:
Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks. DAC 1989: 400-405
Informal and Other Publications
- 2020
- [i1]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:
Computer-Aided Personalized Education. CoRR abs/2007.03704 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
