The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ran Libeskind-Hadas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ran Libeskind-Hadas, C. L. Liu
    Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks. [Citation Graph (0, 0)][DBLP]
    DAC, 1989, pp:400-405 [Conf]
  2. Ran Libeskind-Hadas, Eli Brandt
    Origin-Based Fault-Tolerant routing in the Mesh. [Citation Graph (0, 0)][DBLP]
    HPCA, 1995, pp:102-111 [Conf]
  3. Ran Libeskind-Hadas, Kevin Watkins, Thomas Hehre
    Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels. [Citation Graph (0, 0)][DBLP]
    HPCA, 1996, pp:180-190 [Conf]
  4. Ran Libeskind-Hadas, Rami G. Melhem
    Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICN (1), 2001, pp:508-519 [Conf]
  5. Ran Libeskind-Hadas, Jeffrey R. K. Hartline
    Efficient Multicast in Heterogeneous Networks of Workstations. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2000, pp:403-410 [Conf]
  6. Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
    Tree-Based Multicasting in Wormhole-Routed Irregular Topologies. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:244-249 [Conf]
  7. Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
    Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:358-364 [Conf]
  8. Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams
    On Edge-Disjoint Spanning Trees in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:13-16 [Journal]
  9. Ran Libeskind-Hadas, Jeffrey R. K. Hartline, P. Boothe, G. Rae, J. Swisher
    On Multicast Algorithms for Heterogeneous Networks of Workstations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:11, pp:1665-1679 [Journal]
  10. Philip K. McKinley, N. Hasan, Ran Libeskind-Hadas, C. L. Liu
    Disjoint Covers in Replicated Heterogeneous Arrays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:281-292 [Journal]
  11. Ran Libeskind-Hadas
    A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:10, pp:1158-1160 [Journal]
  12. Ian Ferrel, Adrian Mettler, Edward Miller, Ran Libeskind-Hadas
    Virtual topologies for multicasting with multiple originators in WDM networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:183-190 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2004, v:12, n:2, pp:375-383 [Journal]
  14. Ran Libeskind-Hadas, Rami G. Melhem
    Multicast routing and wavelength assignment in multihop optical networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:5, pp:621-629 [Journal]
  15. Ran Libeskind-Hadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu
    Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:5, pp:498-511 [Journal]
  16. Zachary Dodds, Christine Alvarado, Geoff Kuenning, Ran Libeskind-Hadas
    Breadth-first CS 1 for scientists. [Citation Graph (0, 0)][DBLP]
    ITiCSE, 2007, pp:23-27 [Conf]

  17. Approximation Algorithms for Traffic Grooming in WDM Rings. [Citation Graph (, )][DBLP]


  18. Evaluating a breadth-first cs 1 for scientists. [Citation Graph (, )][DBLP]


  19. When CS 1 is biology 1: crossdisciplinary collaboration as CS context. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002