Jeffrey R. K. Hartline

According to our database, Jeffrey R. K. Hartline authored at least 7 papers between 2000 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

Incremental Optimization.

Jeffrey R. K. Hartline

PhD thesis, 2008

2004

Optimal virtual topologies for one-to-many communication in WDM paths and rings.

Jeffrey R. K. Hartline, Ran Libeskind-Hadas, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray

IEEE/ACM Trans. Netw., 2004

On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches.

Edward Miller, Ran Libeskind-Hadas, D. Barnard, W. Chang, Kurt M. Dresner, W. M. Turner, Jeffrey R. K. Hartline

IEEE J. Sel. Areas Commun., 2004

2003

The Computational Complexity of Motion Planning.

Jeffrey R. K. Hartline, Ran Libeskind-Hadas

SIAM Rev., 2003

2002

Multicast virtual topologies in WDM paths and rings with splitting loss.

Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray

Proceedings of the 11th International Conference on Computer Communications and Networks, 2002

2001

On Multicast Algorithms for Heterogeneous Networks of Workstations.

Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Peter Boothe, Greg Rae, Jascha Swisher

J. Parallel Distributed Comput., 2001

2000

Efficient Multicast in Heterogeneous Networks of Workstations.

Ran Libeskind-Hadas, Jeffrey R. K. Hartline

Proceedings of the 2000 International Workshop on Parallel Processing, 2000