A Markov-Modulated M/G/1 Queue I: Stationary Distribution. - Charles Knessl; B. J. Matkowsky; Zeev Schuss; Charles Tier (Queueing Syst. Theory Appl., 1986)

A Markov-Modulated M/G/1 Queue II: Busy Period and Time for Buffer Overflow. - Charles Knessl; B. J. Matkowsky; Zeev Schuss; Charles Tier (Queueing Syst. Theory Appl., 1986)

Two Parallel Queues with Dynamic Routing. - Charles Knessl; Bernard J. Matkowsky; Zeev Schuss; Charles Tier (IEEE Trans. Commun., 1986)

Busy Period Distribution in State-Dependent Queues. - Charles Knessl; B. J. Matkowsky; Zeev Schuss; Charles Tier (Queueing Syst. Theory Appl., 1987)

Asymptotic Expansions for a Closed Multiple Access System. - Charles Knessl; B. J. Matkowsky; Zeev Schuss; Charles Tier (SIAM J. Comput., 1987)

Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content. - Charles Knessl; Bernard J. Matkowsky; Zeev Schuss; Charles Tier (IEEE Trans. Commun., 1987)

Refinements to Heavy Traffic Limit Theorems in Queueing Theory. - Charles Knessl (Oper. Res., 1990)

An Integral Equation Approach to the M/G/2 Queue. - Charles Knessl; Bernard J. Matkowsky; Zeev Schuss; Charles Tier (Oper. Res., 1990)

Asymptotic Expansions for Large Closed Queuing Networks - Charles Knessl; Charles Tier (J. ACM, 1990)

Heavy-Traffic Analysis of the Sojourn Time in a Three Node Jackson Network with Overtaking. - Charles Knessl; John A. Morrison (Queueing Syst. Theory Appl., 1991)

Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. - Charles Knessl; Charles Tier (IEEE Trans. Computers, 1992)

On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. - Charles Knessl (J. ACM, 1993)

The conditional sojourn time distribution in the GI/M/1 processor-sharing queue in heavy traffic. - Xiaoming Tan; Yongzhi (Peter) Yang; Charles Knessl (Queueing Syst. Theory Appl., 1993)

A Finite Capacity PS Queue Which Models Switching Times. - Xiaoming Tan; Charles Knessl (SIAM J. Appl. Math., 1993)

On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics. - Shisheng Xie; Charles Knessl (SIAM J. Appl. Math., 1993)

The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic. - Yongzhi (Peter) Yang; Charles Knessl (SIAM J. Appl. Math., 1993)

Asymptotic behavior of high-order differences of the plane partition function. - Charles Knessl (Discret. Math., 1994)

On the Distribution of the Maximum Number of Broken Machines for the Repairman Problem. - Charles Knessl (SIAM J. Appl. Math., 1994)

Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin I. - Charles Knessl; Craig Steven Peters (SIAM J. Appl. Math., 1994)

A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics. - Charles Knessl; Charles Tier (SIAM J. Appl. Math., 1994)

Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times. - Xiaoming Tan; Charles Knessl (SIAM J. Appl. Math., 1994)

A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics. - Xiaoming Tan; Charles Knessl (Queueing Syst. Theory Appl., 1996)

Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin II. - Charles Knessl; Craig Steven Peters (SIAM J. Appl. Math., 1996)

Asymptotic Analysis of the M/G/1 Queue with a Time-Dependent Arrival Rate. - Yongzhi (Peter) Yang; Charles Knessl (Queueing Syst. Theory Appl., 1997)

Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work I. - Charles Knessl; Xiaoqian Tan (SIAM J. Appl. Math., 1997)

Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work II. - Charles Knessl; Xiaoqian Tan (SIAM J. Appl. Math., 1997)

Quicksort Again Revisited. - Charles Knessl; Wojciech Szpankowski (RANDOM, 1998)

A Note on the Asymptotic Behavior of the Depth of Tries. - Charles Knessl (Algorithmica, 1998)

Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. - Charles Knessl; Charles Tier (Perform. Evaluation, 1998)

An explicit solution to a tandem queueing model. - Charles Knessl (Queueing Syst. Theory Appl., 1998)

Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times. - Charles Knessl; Charles Tier (SIAM J. Appl. Math., 1998)

Quicksort Algorithm Again Revisited. - Charles Knessl; Wojciech Szpankowski (Discret. Math. Theor. Comput. Sci., 1999)

Two Tandem Queues with General Renewal Input I: Diffusion Approximation and Integral Representations. - Charles Knessl; Charles Tier (SIAM J. Appl. Math., 1999)

Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model. - Charles Knessl; Charles Tier (SIAM J. Appl. Math., 1999)

Heights in Generalized Tries and PATRICIA Tries. - Charles Knessl; Wojciech Szpankowski (LATIN, 2000)

Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. - Charles Knessl; Wojciech Szpankowski (SODA, 2000)

A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. - Charles Knessl; Wojciech Szpankowski (Electron. J. Comb., 2000)

Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems. - Charles Knessl (SIAM J. Appl. Math., 2000)

Probability of Brownian Motion Hitting an Obstacle. - Charles Knessl; Joseph B. Keller (SIAM J. Appl. Math., 2000)

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. - Charles Knessl; Wojciech Szpankowski (SIAM J. Comput., 2000)

Geometrical optics and chessboard pebbling. - Charles Knessl (Appl. Math. Lett., 2001)

Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue. - Charles Knessl; Yongzhi (Peter) Yang (Queueing Syst. Theory Appl., 2001)

On Two-Dimensional Convection-Diffusion Past a Circle. - Charles Knessl (SIAM J. Appl. Math., 2001)

A simple fluid model for servicing priority traffic. - Charles Knessl; Charles Tier (IEEE Trans. Autom. Control., 2001)

Limit laws for the height in PATRICIA tries. - Charles Knessl; Wojciech Szpankowski (J. Algorithms, 2002)

An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service. - Charles Knessl; Yongzhi (Peter) Yang (Queueing Syst. Theory Appl., 2002)

The height of a binary search tree: the limiting distribution perspective. - Charles Knessl; Wojciech Szpankowski (Theor. Comput. Sci., 2002)

Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. - Charles Knessl (Discret. Math. Theor. Comput. Sci., 2003)

Heavy Traffic Analysis of Two Coupled Processors. - Charles Knessl; John A. Morrison (Queueing Syst. Theory Appl., 2003)

A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types. - Charles Knessl; Charles Tier; Doo Il Choi (SIAM J. Appl. Math., 2003)

A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models. - Diego Dominici; Charles Knessl (Appl. Math. Lett., 2004)

Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers. - Charles Knessl (Queueing Syst. Theory Appl., 2004)

On the number of full levels in tries. - Charles Knessl; Wojciech Szpankowski (Random Struct. Algorithms, 2004)

Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. - Charles Knessl; Wojciech Szpankowski (ALENEX/ANALCO, 2005)

Enumeration of Binary Trees and Universal Types. - Charles Knessl; Wojciech Szpankowski (Discret. Math. Theor. Comput. Sci., 2005)

Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation. - Charles Knessl; John A. Morrison (SIAM J. Appl. Math., 2005)

Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. - Charles Knessl; Wojciech Szpankowski (ANALCO, 2006)

On the Erlang Loss Model with Time Dependent Input. - Charles Knessl; Yongzhi (Peter) Yang (Queueing Syst. Theory Appl., 2006)

On the infinite server shortest queue problem: Non-symmetric case. - Haishen Yao; Charles Knessl (Queueing Syst. Theory Appl., 2006)

Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks. - Diego Dominici; Charles Knessl (SIAM J. Appl. Math., 2006)

Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. - Qiang Zhen; Charles Knessl (Queueing Syst. Theory Appl., 2007)

A simple direct solution to a storage allocation model. - Eunju Sohn; Charles Knessl (Appl. Math. Lett., 2008)

On the number of reachable configurations for the chessboard pebbling problem. - Charles Knessl (Math. Comput. Model., 2008)

Some first passage time problems for the shortest queue model. - Haishen Yao; Charles Knessl (Queueing Syst. Theory Appl., 2008)

On sojourn times in the finite capacity M/M/1 queue with processor sharing. - Qiang Zhen; Charles Knessl (Oper. Res. Lett., 2009)

A Two-Dimensional Diffusion Approximation for a Loss Model with Trunk Reservation. - Charles Knessl; John A. Morrison (SIAM J. Appl. Math., 2009)

Drift-Diffusion Past a Circle: Shadow Region Asymptotics. - Sean Lynch; Charles Knessl (SIAM J. Appl. Math., 2009)

Wireless multi-hop networks with stealing: Large buffer asymptotics. - Fabrice Guillemin; Charles Knessl; Johan van Leeuwaarden (ITC, 2010)

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. - Qiang Zhen; Charles Knessl (Math. Methods Oper. Res., 2010)

On a processor sharing queue that models balking. - Qiang Zhen; Johan van Leeuwaarden; Charles Knessl (Math. Methods Oper. Res., 2010)

Storage allocation under processor sharing I: exact solutions and asymptotics. - Eunju Sohn; Charles Knessl (Queueing Syst. Theory Appl., 2010)

On some simple single server models of dynamic storage. - Eunju Sohn; Charles Knessl (QTNA, 2011)

Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case. - Charles Knessl; John A. Morrison (Adv. Oper. Res., 2011)

On a free boundary problem for an American put option under the CEV process. - Miao Xu; Charles Knessl (Appl. Math. Lett., 2011)

An effective asymptotic formula for the Stieltjes constants. - Charles Knessl; Mark W. Coffey (Math. Comput., 2011)

An asymptotic form for the Stieltjes constants gammak(a) and for a sum Sgamma(n) appearing under the Li criterion. - Charles Knessl; Mark W. Coffey (Math. Comput., 2011)

Wireless Multihop Networks with Stealing: Large Buffer Asymptotics via the Ray Method. - Fabrice Guillemin; Charles Knessl; Johan van Leeuwaarden (SIAM J. Appl. Math., 2011)

On a Recurrence Arising in Graph Compression. - Yongwook Choi; Charles Knessl; Wojciech Szpankowski (Electron. J. Comb., 2012)

Counting Markov Types, Balanced Matrices, and Eulerian Graphs. - Philippe Jacquet; Charles Knessl; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 2012)

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits. - Charles Knessl; Haishen Yao (Adv. Oper. Res., 2013)

On spectral properties of finite population processor shared queues. - Qiang Zhen; Charles Knessl (Math. Methods Oper. Res., 2013)

Wireless three-hop networks with stealing II: exact solutions through boundary value problems. - Fabrice Guillemin; Charles Knessl; Johan van Leeuwaarden (Queueing Syst. Theory Appl., 2013)

Expected External Profile of PATRICIA Tries. - Abram Magner; Charles Knessl; Wojciech Szpankowski (ANALCO, 2014)

A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. - Philippe Jacquet; Charles Knessl; Wojciech Szpankowski (Comb. Probab. Comput., 2014)

First response to letter of G. Fayolle and R. Iasnogorodski. - Fabrice Guillemin; Charles Knessl; J. S. H. van Leeuwaarden (Queueing Syst. Theory Appl., 2014)

Erratum to: Wireless three-hop networks with stealing II: exact solutions through boundary value problems. - Fabrice Guillemin; Charles Knessl; Johan van Leeuwaarden (Queueing Syst. Theory Appl., 2014)

A note on the transition from diffusion with the flow to diffusion against the flow, for first passage times in singularly perturbed drift-diffusion models. - Charles Knessl; Haishen Yao (Asymptot. Anal., 2015)

Transient analysis of the Erlang A model. - Charles Knessl; Johan van Leeuwaarden (Math. Methods Oper. Res., 2015)

Asymptotic Analysis of a Storage Allocation Model with Finite Capacity: Joint Distribution. - Eunju Sohn; Charles Knessl (Adv. Oper. Res., 2016)