Articles in Scholarly Journals [Incomplete List]

1. Queueing systems with inventory management with random lead times and with backordering
   Mathematical Methods of Operations Research, vol. 64, no. 3, pp. 383–414, 2006
2. M/M/1 Queueing systems with inventory
   Queueing Systems, vol. 54, no. 1, pp. 55–78, 2006
3. Dependence ordering for Markov processes on partially ordered spaces
   Journal of Applied Probability, vol. 43, no. 3, pp. 793–814, 2006
4. An invariance property of sojourn times in cyclic networks
   Operations Research Letters, vol. 33, no. 1, pp. 1–8, 2005
5. Stochastic games for distributed players on graphs
   Mathematical Methods of Operational Research, vol. 60, no. 2, pp. 279–298, 2004
6. On the Correlation Structure of Closed Queueing Networks
   Stochastic Models, vol. 20, no. 1, pp. 1–29, 2004
7. Dependence structure of sojourn times via partition separated ordering
   Operations Research Letters, vol. 31, no. 6, pp. 462–472, 2003
8. Asymptotic Throughput in Discrete-Time Cyclic Networks with Queue-Length-Dependent Service Rates
   Stochastic Models, vol. 19, no. 4, pp. 483–506, 2003
9. Conditional job-observer property for multitype closed queueing networks
   Journal of Applied Probability, vol. 39, no. 4, pp. 865–881, 2002
10. Discrete time tandem networks of queues Effects of different regulation schemes for simultaneous events
    Performance Evaluation, vol. 47, no. 2-3, pp. 73–104, 2002
11. Cybernetics and Systems Analysis, vol. 37, no. 3, pp. 348–360, 2001
12. Queueing Systems, vol. 34, no. 1/4, pp. 169–181, 2000
13. Optimal admission control for M/D/1/K queueing systems
    Mathematical Methods of Operations Research (ZOR), vol. 50, no. 1, pp. 91–100, 1999
14. Queueing Systems, vol. 32, no. 4, pp. 351–362, 1999
15. Queueing Systems, vol. 27, no. 3/4, pp. 297–323, 1997
16. Some results for steady-state and sojourn time distributions in open and closed linear networks of Bernoulli servers with state-dependent service and arrival rates
    Performance Evaluation, vol. 30, no. 1-2, pp. 3–18, 1997
17. A queueing theoretical proof of increasing property of Polya frequency functions
    Statistics & Probability Letters, vol. 26, no. 3, pp. 233–242, 1996
18. The cycle time distribution in a cycle of Bernoulli servers in discrete time
    Mathematical Methods of Operations Research, vol. 44, no. 3, pp. 295–332, 1996
19. Dependencies in Markovian Networks
    Advances in Applied Probability, vol. 27, no. 1, p. 226, 1995
20. On the stability of queueing systems under precedence restrictions for the service of customers
    Queueing Systems, vol. 17, no. 1-2, pp. 73–88, 1994
21. Simultaneous busy periods for nodes in a stochastic network
    Performance Evaluation, vol. 9, no. 2, pp. 103–109, 1989
22. Busy periods for subnetworks in stochastic networks: mean value analysis
    Journal of the ACM, vol. 35, no. 3, pp. 668–674, 1988
23. Optimal control of a queueing system with an exponential and an Erlangian server and renewal input stream
    Optimization, vol. 18, no. 6, pp. 883–892, 1987
24. Sojourn Times in Queuing Networks with Multiserver Modes
    Journal of Applied Probability, vol. 24, no. 2, p. 511, 1987
25. The cycle-time distribution in a central server network with state-dependent branching
    Optimization, vol. 16, no. 4, pp. 617–626, 1985
26. The busy period distribution in a closed tandem of queues
    Optimization, vol. 16, no. 5, pp. 755–766, 1985
27. Burke's Theorem on Passage Times in Gordon-Newell Networks
    Advances in Applied Probability, vol. 16, no. 4, p. 867, 1984
28. The Time for a Round Trip in a Cycle of Exponential Queues
    Journal of the ACM, vol. 30, no. 1, pp. 146–150, 1983
29. Networks of queues in discrete time
    Zeitschrift für Operations Research, vol. 27, no. 1, pp. 159–175, 1983
30. On passage times in Jackson networks: Two-stations walk and overtake-free paths
    Zeitschrift für Operations Research, vol. 27, no. 1, pp. 239–256, 1983
31. Passage Times for Overtake-Free Paths in Gordon-Newell Networks
    Advances in Applied Probability, vol. 14, no. 3, p. 672, 1982
32. A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions
    Acta Informatica, vol. 15, no. 3, pp. 251–263, 1981