Charles Knessl

Publication Activity (10 Years)

Years Active: 1986-2016
Publications (10 Years): 3

Top Topics

Navier Stokes Equations

Diffusion Model

Terminological Reasoning

Joint Distribution

Top Venues

Queueing Syst. Theory Appl.

Adv. Oper. Res.

Math. Methods Oper. Res.

Comb. Probab. Comput.

Publications

Eunju Sohn, Charles Knessl
Asymptotic Analysis of a Storage Allocation Model with Finite Capacity: Joint Distribution. Adv. Oper. Res. 2016 (2016)
Charles Knessl, Johan van Leeuwaarden
Transient analysis of the Erlang A model. Math. Methods Oper. Res. 82 (2) (2015)
Charles Knessl, Haishen Yao
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. Asymptot. Anal. 91 (3-4) (2015)
Philippe Jacquet, Charles Knessl, Wojciech Szpankowski
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. Comb. Probab. Comput. 23 (5) (2014)
Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden
Erratum to: Wireless three-hop networks with stealing II: exact solutions through boundary value problems. Queueing Syst. Theory Appl. 78 (2) (2014)
Abram Magner, Charles Knessl, Wojciech Szpankowski
Expected External Profile of PATRICIA Tries. ANALCO (2014)
Fabrice Guillemin, Charles Knessl, J. S. H. van Leeuwaarden
First response to letter of G. Fayolle and R. Iasnogorodski. Queueing Syst. Theory Appl. 76 (1) (2014)
Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden
Wireless three-hop networks with stealing II: exact solutions through boundary value problems. Queueing Syst. Theory Appl. 74 (2-3) (2013)
Qiang Zhen, Charles Knessl
On spectral properties of finite population processor shared queues. Math. Methods Oper. Res. 77 (2) (2013)
Charles Knessl, Haishen Yao
On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits. Adv. Oper. Res. 2013 (2013)
Philippe Jacquet, Charles Knessl, Wojciech Szpankowski
Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Trans. Inf. Theory 58 (7) (2012)
Yongwook Choi, Charles Knessl, Wojciech Szpankowski
On a Recurrence Arising in Graph Compression. Electron. J. Comb. 19 (3) (2012)
Charles Knessl, Mark W. Coffey
An effective asymptotic formula for the Stieltjes constants. Math. Comput. 80 (273) (2011)
Miao Xu, Charles Knessl
On a free boundary problem for an American put option under the CEV process. Appl. Math. Lett. 24 (7) (2011)
Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden
Wireless Multihop Networks with Stealing: Large Buffer Asymptotics via the Ray Method. SIAM J. Appl. Math. 71 (4) (2011)
Charles Knessl, Mark W. Coffey
(n) appearing under the Li criterion. Math. Comput. 80 (276) (2011)
Eunju Sohn, Charles Knessl
On some simple single server models of dynamic storage. QTNA (2011)
Charles Knessl, John A. Morrison
Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case. Adv. Oper. Res. 2011 (2011)
Qiang Zhen, Johan van Leeuwaarden, Charles Knessl
On a processor sharing queue that models balking. Math. Methods Oper. Res. 72 (3) (2010)
Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden
Wireless multi-hop networks with stealing: Large buffer asymptotics. International Teletraffic Congress (2010)
Eunju Sohn, Charles Knessl
Storage allocation under processor sharing I: exact solutions and asymptotics. Queueing Syst. Theory Appl. 65 (1) (2010)
Qiang Zhen, Charles Knessl
/1-PS queue. Math. Methods Oper. Res. 71 (2) (2010)
Charles Knessl, John A. Morrison
A Two-Dimensional Diffusion Approximation for a Loss Model with Trunk Reservation. SIAM J. Appl. Math. 69 (5) (2009)
Qiang Zhen, Charles Knessl
On sojourn times in the finite capacity M/M/1 queue with processor sharing. Oper. Res. Lett. 37 (6) (2009)
Sean Lynch, Charles Knessl
Drift-Diffusion Past a Circle: Shadow Region Asymptotics. SIAM J. Appl. Math. 69 (6) (2009)
Eunju Sohn, Charles Knessl
A simple direct solution to a storage allocation model. Appl. Math. Lett. 21 (2) (2008)
Haishen Yao, Charles Knessl
Some first passage time problems for the shortest queue model. Queueing Syst. Theory Appl. 58 (2) (2008)
Charles Knessl
On the number of reachable configurations for the chessboard pebbling problem. Math. Comput. Model. 47 (1-2) (2008)
Qiang Zhen, Charles Knessl
Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Syst. Theory Appl. 57 (4) (2007)
Charles Knessl, Yongzhi (Peter) Yang
On the Erlang Loss Model with Time Dependent Input. Queueing Syst. Theory Appl. 52 (1) (2006)
Diego Dominici, Charles Knessl
Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks. SIAM J. Appl. Math. 66 (6) (2006)
Charles Knessl, Wojciech Szpankowski
Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. ANALCO (2006)
Haishen Yao, Charles Knessl
On the infinite server shortest queue problem: Non-symmetric case. Queueing Syst. Theory Appl. 52 (2) (2006)
Charles Knessl, Wojciech Szpankowski
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO (2005)
Charles Knessl, John A. Morrison
Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation. SIAM J. Appl. Math. 66 (1) (2005)
Charles Knessl, Wojciech Szpankowski
Enumeration of Binary Trees and Universal Types. Discret. Math. Theor. Comput. Sci. 7 (1) (2005)
Diego Dominici, Charles Knessl
A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models. Appl. Math. Lett. 17 (5) (2004)
Charles Knessl
Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers. Queueing Syst. Theory Appl. 47 (3) (2004)
Charles Knessl, Wojciech Szpankowski
On the number of full levels in tries. Random Struct. Algorithms 25 (3) (2004)
Charles Knessl, Charles Tier, Doo Il Choi
A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types. SIAM J. Appl. Math. 63 (2) (2003)
Charles Knessl, John A. Morrison
Heavy Traffic Analysis of Two Coupled Processors. Queueing Syst. Theory Appl. 43 (3) (2003)
Charles Knessl
Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. Discret. Math. Theor. Comput. Sci. 6 (1) (2003)
Charles Knessl, Wojciech Szpankowski
The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. 289 (1) (2002)
Charles Knessl, Yongzhi (Peter) Yang
An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service. Queueing Syst. Theory Appl. 40 (3) (2002)
Charles Knessl, Wojciech Szpankowski
Limit laws for the height in PATRICIA tries. J. Algorithms 44 (1) (2002)
Charles Knessl
On Two-Dimensional Convection-Diffusion Past a Circle. SIAM J. Appl. Math. 62 (1) (2001)
Charles Knessl
Geometrical optics and chessboard pebbling. Appl. Math. Lett. 14 (3) (2001)
Charles Knessl, Yongzhi (Peter) Yang
Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue. Queueing Syst. Theory Appl. 39 (2/3) (2001)
Charles Knessl, Charles Tier
A simple fluid model for servicing priority traffic. IEEE Trans. Autom. Control. 46 (6) (2001)
Charles Knessl, Wojciech Szpankowski
Heights in Generalized Tries and PATRICIA Tries. LATIN (2000)
Charles Knessl
Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems. SIAM J. Appl. Math. 61 (3) (2000)
Charles Knessl, Joseph B. Keller
Probability of Brownian Motion Hitting an Obstacle. SIAM J. Appl. Math. 60 (2) (2000)
Charles Knessl, Wojciech Szpankowski
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA (2000)
Charles Knessl, Wojciech Szpankowski
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. SIAM J. Comput. 30 (3) (2000)
Charles Knessl, Wojciech Szpankowski
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electron. J. Comb. 7 (2000)
Charles Knessl, Charles Tier
Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model. SIAM J. Appl. Math. 59 (6) (1999)
Charles Knessl, Wojciech Szpankowski
Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. 3 (2) (1999)
Charles Knessl, Charles Tier
Two Tandem Queues with General Renewal Input I: Diffusion Approximation and Integral Representations. SIAM J. Appl. Math. 59 (6) (1999)
Charles Knessl, Charles Tier
Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times. SIAM J. Appl. Math. 58 (1) (1998)
Charles Knessl
An explicit solution to a tandem queueing model. Queueing Syst. Theory Appl. 30 (3-4) (1998)
Charles Knessl, Wojciech Szpankowski
Quicksort Again Revisited. RANDOM (1998)
Charles Knessl
A Note on the Asymptotic Behavior of the Depth of Tries. Algorithmica 22 (4) (1998)
Charles Knessl, Charles Tier
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. Perform. Evaluation 33 (4) (1998)
Charles Knessl, Xiaoqian Tan
Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work II. SIAM J. Appl. Math. 57 (3) (1997)
Yongzhi (Peter) Yang, Charles Knessl
Asymptotic Analysis of the M/G/1 Queue with a Time-Dependent Arrival Rate. Queueing Syst. Theory Appl. 26 (1-2) (1997)
Charles Knessl, Xiaoqian Tan
Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work I. SIAM J. Appl. Math. 57 (3) (1997)
Xiaoming Tan, Charles Knessl
A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics. Queueing Syst. Theory Appl. 22 (3-4) (1996)
Charles Knessl, Craig Steven Peters
Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin II. SIAM J. Appl. Math. 56 (5) (1996)
Xiaoming Tan, Charles Knessl
Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times. SIAM J. Appl. Math. 54 (6) (1994)
Charles Knessl, Craig Steven Peters
Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin I. SIAM J. Appl. Math. 54 (6) (1994)
Charles Knessl
On the Distribution of the Maximum Number of Broken Machines for the Repairman Problem. SIAM J. Appl. Math. 54 (2) (1994)
Charles Knessl, Charles Tier
A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics. SIAM J. Appl. Math. 54 (3) (1994)
Charles Knessl
Asymptotic behavior of high-order differences of the plane partition function. Discret. Math. 126 (1-3) (1994)
Charles Knessl
On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. J. ACM 40 (5) (1993)
Xiaoming Tan, Charles Knessl
A Finite Capacity PS Queue Which Models Switching Times. SIAM J. Appl. Math. 53 (2) (1993)
Xiaoming Tan, Yongzhi (Peter) Yang, Charles Knessl
The conditional sojourn time distribution in the GI/M/1 processor-sharing queue in heavy traffic. Queueing Syst. Theory Appl. 14 (1-2) (1993)
Shisheng Xie, Charles Knessl
On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics. SIAM J. Appl. Math. 53 (2) (1993)
Yongzhi (Peter) Yang, Charles Knessl
The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic. SIAM J. Appl. Math. 53 (4) (1993)
Charles Knessl, Charles Tier
Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. IEEE Trans. Computers 41 (4) (1992)
Charles Knessl, John A. Morrison
Heavy-Traffic Analysis of the Sojourn Time in a Three Node Jackson Network with Overtaking. Queueing Syst. Theory Appl. 8 (2) (1991)
Charles Knessl, Charles Tier
Asymptotic Expansions for Large Closed Queuing Networks J. ACM 37 (1) (1990)
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
An Integral Equation Approach to the M/G/2 Queue. Oper. Res. 38 (3) (1990)
Charles Knessl
Refinements to Heavy Traffic Limit Theorems in Queueing Theory. Oper. Res. 38 (5) (1990)
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier
Busy Period Distribution in State-Dependent Queues. Queueing Syst. Theory Appl. 2 (3) (1987)
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier
Asymptotic Expansions for a Closed Multiple Access System. SIAM J. Comput. 16 (2) (1987)
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content. IEEE Trans. Commun. 35 (11) (1987)
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier
A Markov-Modulated M/G/1 Queue II: Busy Period and Time for Buffer Overflow. Queueing Syst. Theory Appl. 1 (4) (1986)
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
Two Parallel Queues with Dynamic Routing. IEEE Trans. Commun. 34 (12) (1986)
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier
A Markov-Modulated M/G/1 Queue I: Stationary Distribution. Queueing Syst. Theory Appl. 1 (4) (1986)