Charles Knessl

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