Publications of V G Kulkarni
 

Area 1:  Stochastic Processes:  Theory.
 

  • A fluctuation theory for Markov chains, with N.U. Prabhu,

  • Stochastic Processes and Their Applications, 16, 39-54, 1983.
  • Limiting distributions of functionals of Markov chains, with R.L.Karandikar,

  • Stochastic Processes and Their Applications, 19, 225-235, 1985.
  • Some limit theorems for cumulative processes with applications to sojourn times,

  • Operations Research Letters, 6, 83-90,1986.
  • A new class of multivariate phase type distributions,

  • Operations Research, 37, 151-158, 1989.
  • Convergence of moments of Markov chains and semiMarkov processes,

  • with R.L. Karandikar, Probability, Statistics and Design of Experiments,
    R.R. Bahadiny (eds), Wiley Eastern, New Delhi, 453-460, 1990.
  • Optimal implementable policies :  discounted cost case, with Y. Serin,

  • Computations with Markov Chains, 283-307, ed: W. Stewart; Kluwer Academic Publications, 1995.
  • Introduction to Technical Articles, (Guest Editor) QUESTA, 24, 19-22, 1997.
  • Discrete Time Markov Chains, Section 7.7 in CRC Handbook on Dicrete and Combinatorial Mathematics, CRC Press, 2000.
  • Queueing theory, Section 7.8 in CRC Handbook on Dicrete and Combinatorial Mathematics, CRC Press.


Area 2:  Queueing Systems with  Retrials.
 

  • On queueing systems with retrials, Journal of Applied Probability, 20, 380-389, 1983.
  • A game theoretical model for two types of customers competing for service, Operations Research Letters, 2, 119-122, 1983.
  • Expected waiting times in multiclass batch arrival retrial queues,

  • Journal of Applied Probability, 23, 144-154, 1986.
  • Deterministic retrial times are optimal in queues with forbidden states, with S.P. Sethi, INFOR}, 27, 374-386, 1986.
  • Optimal retrial policies for restrained Markov chains, Stochastic Models, 5, 401-429, 1989.
  • Retrial queues with server subject to breakdowns and repairs, with B.D. Choi, Queueing Systems, 7, 191-208, 1990.
  • Feedback retrial queueing systems, with B.D. Choi, Queueing and Related Models, Chapter 5, 93-105.  U.N. Bhat and I.V. Balawa (eds.), Oxford University Press, 1992.
  • Monotonicity properties of retrial queues, with H.M. Liang, Stochastic Models, 9, 373-400, 1993.
  • Stability condition for a single server retrial queue, with H.M. Liang, Advances in Applied Probability, 25, 690-701, 1993.
  • Retrial queues revisited, with H. M. Liang, Frontiers in Queueing: Models and Applications in Science and Engineering, 19-34,  Ed. J. H. Dshalalow, CRC Press, 19-34, 1997.
  • Optimal Control of Retrial Queues, with H. M. Liang, Applied Probability and Stochastic Process, Eds: J. G. Shanthikumar and U. Sumita, 203-219, 1999.


Area 3:  Reliability and Stochastic Networks.
 
 

  • A compact hash function for paths in PERT networks,  Operations Research Letters,

  • 3, 137-140, 1984.
  • An improved implementation of Monte Carlo estimation of path lengths instochastic networks,

  • ith J.S. Provan, Operations Research, 33, 1389-1393, 1985.
  • Maximum flow in networks with exponentially distributed arc capacities, with V.G. Adlakha,

  • Stochastic Models, 1, 263-290, 1985.
  • A recursive algorithm for the exact computation of network reliability, with M. Bailey,

  • IEEE Trans.  on Reliability, R35, 1, 36-40, 1986.
  • Markov and Markov regenerative PERT networks, with V.G. Adlakha,

  • Operations Research, 34, 769-781, 1986.
  • Shortest paths in networks with exponentially distributed arc lengths,

  • Networks, 16, 255-274, 1986.
  • Minimal spanning trees in undirected networks with exponentially distributed arc weights,

  • Networks, 18, 111-124, 1987.
  •  Exact cuts in networks, with J.S. Provan, Networks, 19, 281-289, 1989.
  • A classified bibliography of research on stochastic PERT network, with V. G. Adlakha,

  • INFOR, 27, 273-290, 1989.
  • Minimum cost routing on stochastic networks, with G.A. Corea,

  • Operations Research, 38, 527-537, 1990.
  • Generating random combinatorial objects,  Journal of Algorithms, 11, 185-207, 1990.
  • Improving Monte Carlo efficiency by increasing variance, with G.S. Fishman,

  • Management Science, 38, 1432-1444, 1992.


Area 4:  Performance Evaluation of Computer Systems.
 
 

  • On modeling the performance and reliability of multimode computersystems, with K.S. Trivedi

  • and V.F. Nicola.  Journal of Systems and Software, 6, 175-182, 1986.
  • Queueing analysis of a fault tolerant computer system, with V.F. Nicola and K.S. Trivedi,

  • IEEE Trans. on Software Engineering, SE13, 3, 363-375, 1987.
  • Numerical Evaluation of performability and job completion time in repairable fault-tolerant systems,

  • with V.F. Nicola, K.S. Trivedi and R.M.Smith. Proceedings of the 16th IEEE International Symposium on FaultTolerant Computing, Vienna, Austria, 252-257, 1986.
  • The completion time of a job on multimode systems, with K.S.  Trivedi and V.F. Nicola,

  • Advances in Applied Probability, 19, 932-954, 1987.
  • Effects of checkpointing and queueing on program performance, with K.S. Trivedi and V.F. Nicola,

  • Stochastic Models, 6, 615-648, 1990.
  • Optimal scheduling of exponential tasks with intree precedence constraints on two parallel processors subject to failure and repair, with P.F. Chimento,  Operations Research, 40, Supplement 2, S263-S271, 1992.
  • Transient analysis of deterministic and stochastic petri nets, with H.Choi and K.S. Trivedi, 14th International Conf. on Appli.  and Theory of Petri Nets, Lecture Notes in Computer Science, 166-185, Chicago, 1993.
  • Markov regenerative stochastic Petri Nets, with H. Choi and K.S. Trivedi, PERFORMANCE 93, International Sym. on Comp. Perf. Modeling, Measurement and Evaluation, 339-356, 1993.
  • FSPNs: Fluid Stochastic Petri Nets, with K. S. Trivedi, Proceedings of the 14th International Conference on Application and theory of Petri Nets, Lecture Notes in Computer Science, 24-31, 1993.
  • Numerical computation of response time distributions using stochastic reward nets, with J. K. Muppala, K. S. Trivedi and V. Mainkar, Annals of Operations Research, 48, 155-184, 1994.
  • A reader-writer queue with reader preference, with L.C. Puryear,  QUESTA, 15, 81-97, 1994.
  • A reader-writer queue with alternating exhaustive priorities, with L.C.Puryear, QUESTA, 19, 81-103, 1995.
  • Stability and queueing-time analysis of a reader-writer queue with writer preference, with L.C. Puryear,

  • Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization,   and Stochastic Modeling Technologies, eds: Richard S. Barr, Richard V. Helgason, Jeffery L. Kennington, Kluwer, 259-279,1997 .
  • Comparison of stability and queueing times in reader-writer queues, with L. C. Puryear,  Journal of Performance Modeling, 30, 195-215, 1997.
  • Optimal Scheduling of Reader-Writer Systems, with K. D. Glazebrook and L.C. Puryear, Naval Research Logistics Quarterly, 45, 483-495, 1998.
  • Optimal Admission to Reader-Writer Systems with no Queueing, with T. Sanli, Operations Research Letters, 25, 213-218, 1999.
Area 5:  Communication Systems.
 
  Area 6:  Business Operations Models.   

  • A Non-renewable Minimal Repair Warranty Policy With Time Dependent Costs, with Shau-shiang Ja, Amit Mitra, and Jayprakash Patankar, IEEE Transactions on Reliability,  50, No. 4, 346-352, 2001.
Area 7:  Miscellaneous.

          Optimal and suboptimal procedures for selecting the best of two Bernoulli populations,
with R.V. Kulkarni, Journal of Statistical Planningand       Inference15,   311-330.