( en | de | ru )

 

Disambiguation of "Libeskind-Hadas, Ran"

Author of the publication

copydeleteadd this publication to your clipboard
A first course in computing with applications to biology.

, and . Briefings Bioinform., 14 (5): 610-617 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ran Ran

Marie-Luisa Hadaschik

Edith Hadaschik

Boris Alexander Hadaschik

Kerstin Hadasch

 

Other publications of authors with the same name

A first course in computing with applications to biology., and . Briefings Bioinform., 14 (5): 610-617 (2013)Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations., , and . IPPS/SPDP, page 358-364. IEEE Computer Society, (1998)Efficient collective communication in WDM networks with a power budget.. ICCCN, page 612-616. IEEE, (2000)Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks., and . DAC, page 400-405. ACM Press, (1989)Maximum parsimony reconciliation in the DTLOR model., , , , , and . BMC Bioinform., 22 (10): 394 (2021)A derivation-first approach to teaching algorithms.. SIGCSE, page 573-578. ACM, (2013)When CS 1 is biology 1: crossdisciplinary collaboration as CS context., , and . ITiCSE, page 219-223. ACM, (2010)Multicast virtual topologies in WDM paths and rings with splitting loss., , , , and . ICCCN, page 318-321. IEEE, (2002)Optimal virtual topologies for one-to-many communication in WDM paths and rings., , , , and . IEEE/ACM Trans. Netw., 12 (2): 375-383 (2004)An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model., , and . BMC Bioinform., 20-S (20): 636 (2019)