| 2008 |
|---|
| 19 | EE | Zachary Dodds,
Ran Libeskind-Hadas,
Christine Alvarado,
Geoff Kuenning:
Evaluating a breadth-first cs 1 for scientists.
SIGCSE 2008: 266-270 |
| 18 | EE | Karyn Benson,
Benjamin 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) |
| 2007 |
|---|
| 17 | EE | Zachary Dodds,
Christine Alvarado,
Geoff Kuenning,
Ran Libeskind-Hadas:
Breadth-first CS 1 for scientists.
ITiCSE 2007: 23-27 |
| 2006 |
|---|
| 16 | EE | 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 |
|---|
| 15 | EE | Edward Miller,
Ran Libeskind-Hadas,
D. Barnard,
W. Chang,
Kurt M. Dresner,
W. M. Turner,
J. R. Hartline:
On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches.
IEEE Journal on Selected Areas in Communications 22(9): 1601-1612 (2004) |
| 14 | EE | 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) |
| 2002 |
|---|
| 13 | EE | 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 |
|---|
| 12 | EE | Ran Libeskind-Hadas,
Rami G. Melhem:
Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks.
ICN (1) 2001: 508-519 |
| 11 | EE | Ran Libeskind-Hadas,
Jeffrey R. K. Hartline,
P. Boothe,
G. Rae,
J. Swisher:
On Multicast Algorithms for Heterogeneous Networks of Workstations.
J. Parallel Distrib. Comput. 61(11): 1665-1679 (2001) |
| 2000 |
|---|
| 10 | EE | Ran Libeskind-Hadas,
Jeffrey R. K. Hartline:
Efficient Multicast in Heterogeneous Networks of Workstations.
ICPP Workshops 2000: 403-410 |
| 1999 |
|---|
| 9 | EE | 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 |
|---|
| 8 | EE | Ran Libeskind-Hadas,
Dominic Mazzoni,
Ranjith Rajagopalan:
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies.
IPPS/SPDP 1998: 244-249 |
| 7 | EE | Ran Libeskind-Hadas,
Dominic Mazzoni,
Ranjith Rajagopalan:
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations.
IPPS/SPDP 1998: 358-364 |
| 6 | | 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) |
| 1996 |
|---|
| 5 | EE | Ran Libeskind-Hadas,
Kevin Watkins,
Thomas Hehre:
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels.
HPCA 1996: 180-190 |
| 1995 |
|---|
| 4 | | Ran Libeskind-Hadas,
Eli Brandt:
Origin-Based Fault-Tolerant routing in the Mesh.
HPCA 1995: 102-111 |
| 3 | EE | Ran Libeskind-Hadas,
Nimish Shrivastava,
Rami G. Melhem,
C. L. Liu:
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays.
IEEE Trans. Parallel Distrib. Syst. 6(5): 498-511 (1995) |
| 1991 |
|---|
| 2 | | Philip K. McKinley,
N. Hasan,
Ran Libeskind-Hadas,
C. L. Liu:
Disjoint Covers in Replicated Heterogeneous Arrays.
SIAM J. Discrete Math. 4(2): 281-292 (1991) |
| 1989 |
|---|
| 1 | EE | Ran Libeskind-Hadas,
C. L. Liu:
Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks.
DAC 1989: 400-405 |
