Numerical studies of the asymptotic height distribution in binary search trees. Knessl, Charles — 2003 Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
A diffusion model for two parallel queues with processor sharing: Transient behavior and asymptotics. Knessl, Charles — 1999 Journal of Applied Mathematics and Stochastic Analysis
A note on the asymptotic behavior of the heights in b -trees for b large. Knessl, Charles; Szpankowski, Wojciech — 2000 The Electronic Journal of Combinatorics [electronic only]
Mean time for the development of large workloads and large queue lengths in the GI/G/1 queue. Knessl, Charles; Tier, Charles — 1996 Journal of Applied Mathematics and Stochastic Analysis
Enumeration of binary trees and universal types. Knessl, Charles; Szpankowski, Wojciech — 2005 Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Quicksort algorithm again revisited. Knessl, Charles; Szpankowski, Wojciech — 1999 Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Asymptotic analysis by the saddle point method of the Anick-Mitra-Sondhi model. Dominici, Diego; Knessl, Charles — 2004 Journal of Applied Mathematics and Stochastic Analysis
Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic. Morrison, John A.; Knessl, Charles — 2008 Journal of Applied Mathematics and Stochastic Analysis
Two coupled queues with vastly different arrival rates: critical loading case. Knessl, Charles; Morrison, John A. — 2011 Advances in Operations Research
A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks. Choi, Doo Il; Knessl, Charles; Tier, Charles — 1999 Journal of Applied Mathematics and Stochastic Analysis