Robert B. Cooper

According to our database1, Robert B. Cooper authored at least 18 papers between 1970 and 2000.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Performance and control of network systems.
Perform. Evaluation, 2000

Book Reviews.
Interfaces, 2000

1997
Introduction.
Telecommun. Syst., 1997

1996
A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive.
Oper. Res., 1996

1995
Relating polling models with zero and nonzero switchover times.
Queueing Syst. Theory Appl., 1995

1993
An Infinite Sum of Erlang Loss Functions.
SIAM Rev., 1993

Transform-Free Analysis of M/G/1/K and Related Queues.
Math. Oper. Res., 1993

1991
A Suality Relation for Busy Cycles in GI/G/1 Queues.
Queueing Syst. Theory Appl., 1991

1989
Duality and Other Results for <i>M</i>/<i>G</i>/1 and <i>GI</i>/<i>M</i>/1 Queues, Via a New Ballot Theorem.
Math. Oper. Res., 1989

1987
Queues with Ordered Servers that Work at Different Rates: An Exact Analysis of a Model Solved Approximately by Others.
Perform. Evaluation, 1987

Information-Theoretic Complexity of Program Specifications.
Comput. J., 1987

1985
Stochastic Decompositions in the <i>M</i>/<i>G</i>/1 Queue with Generalized Vacations.
Oper. Res., 1985

Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models - Especially token-ring LANs.
AT&T Tech. J., 1985

1984
The Average Time Until Bucket Overflow.
ACM Trans. Database Syst., 1984

1983
Comparison of simulation and analytical packages for performance evaluation.
Proceedings of the 15th conference on Winter simulation, 1983

1981
Queueing theory.
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1972
Queues with Service in Random Order.
Oper. Res., 1972

1970
Queues served in cyclic order: Waiting times.
Bell Syst. Tech. J., 1970


  Loading...