Paul Stelling

According to our database, Paul Stelling authored at least 3 papers between 1996 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1999

A fault detection service for wide area distributed computations.

Paul Stelling, Cheryl DeMatteis, Ian T. Foster, Carl Kesselman, Craig A. Lee, Gregor von Laszewski

Clust. Comput., 1999

1998

A Fault Detection Service for Wide Area Distributed Computations.

Paul Stelling, Ian T. Foster, Carl Kesselman, Craig A. Lee, Gregor von Laszewski

Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing, 1998

1996

Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.

Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996