Scott K. Walley

According to our database, Scott K. Walley authored at least 4 papers between 1993 and 1996.

Collaborative distances:

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

1996

A Tandem of Discrete-Time Queues with Arrivals and Departures at Each Stage.

Scott K. Walley, Audrey M. Viterbi

Queueing Syst. Theory Appl., 1996

1995

Shortest Paths in Random Weighted Graphs.

Scott K. Walley, Harry H. Tan

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Limit Distributions for the Diameter and the Shortest Path Hop Count in Random Graphs with Positive Integer Edge Costs.

Scott K. Walley, Harry H. Tan, Audrey M. Viterbi

Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1993

Shortest Path Cost Distribution in Random Graphs with Positive Integer Edge Costs.

Scott K. Walley, Harry H. Tan, Audrey M. Viterbi

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993