Citation: C. Knessl, INTEGRAL-REPRESENTATIONS AND ASYMPTOTIC EXPANSIONS FOR SHANNON AND RENYI ENTROPIES, Applied mathematics letters, 11(2), 1998, pp. 69-74
Citation: C. Knessl et C. Tier, ASYMPTOTIC APPROXIMATIONS AND BOTTLENECK ANALYSIS IN PRODUCT FORM QUEUING-NETWORKS WITH LARGE POPULATIONS, Performance evaluation, 33(4), 1998, pp. 219-248
Citation: C. Knessl et C. Tier, HEAVY TRAFFIC ANALYSIS OF A MARKOV-MODULATED QUEUE WITH FINITE-CAPACITY AND GENERAL SERVICE TIMES, SIAM journal on applied mathematics, 58(1), 1998, pp. 257-323
Citation: Xq. Tan et C. Knessl, INTEGRAL-REPRESENTATIONS AND ASYMPTOTICS FOR INFINITE-CAPACITY AND FINITE-CAPACITY QUEUES DESCRIBED BY THE UNFINISHED WORK .1., SIAM journal on applied mathematics, 57(3), 1997, pp. 791-823
Citation: Xm. Tan et C. Knessl, A FORK-JOIN QUEUING MODEL - DIFFUSION-APPROXIMATION, INTEGRAL-REPRESENTATIONS AND ASYMPTOTICS, Queuing systems, 22(3-4), 1996, pp. 287-322
Citation: C. Knessl et Cs. Peters, EXACT AND ASYMPTOTIC SOLUTIONS FOR THE TIME-DEPENDENT PROBLEM OF COLLECTIVE RUIN .2., SIAM journal on applied mathematics, 56(5), 1996, pp. 1471-1521
Citation: C. Knessl et Cs. Peters, EXACT AND ASYMPTOTIC SOLUTIONS FOR THE TIME-DEPENDENT PROBLEM OF COLLECTIVE RUIN .1., SIAM journal on applied mathematics, 54(6), 1994, pp. 1745-1767
Citation: Xm. Tan et C. Knessl, HEAVY TRAFFIC ASYMPTOTICS FOR A GATED, INFINITE-SERVER QUEUE WITH UNIFORM SERVICE TIMES, SIAM journal on applied mathematics, 54(6), 1994, pp. 1768-1779
Citation: C. Knessl et C. Tier, A PROCESSOR-SHARED QUEUE THAT MODELS SWITCHING TIMES - HEAVY USAGE ASYMPTOTICS, SIAM journal on applied mathematics, 54(3), 1994, pp. 854-875
Citation: C. Knessl, ON THE DISTRIBUTION OF THE MAXIMUM NUMBER OF BROKEN MACHINES FOR THE REPAIRMAN PROBLEM, SIAM journal on applied mathematics, 54(2), 1994, pp. 508-547
Citation: Yz. Yang et C. Knessl, THE UNCONDITIONAL SOJOURN TIME DISTRIBUTION IN THE QUEUE GI M-1-K WITH PROCESSOR SHARING SERVICE, Studies in applied mathematics, 93(1), 1994, pp. 29-91
Citation: Yz. Yang et C. Knessl, CONDITIONAL SOJOURN TIME MOMENTS IN THE FINITE-CAPACITY GI M/1 QUEUE WITH PROCESSOR-SHARING SERVICE/, SIAM journal on applied mathematics, 53(4), 1993, pp. 1132-1193
Citation: C. Knessl, ON THE SOJOURN TIME DISTRIBUTION IN A FINITE-CAPACITY PROCESSOR SHARED QUEUE, Journal of the Association for Computing Machinery, 40(5), 1993, pp. 1238-1301