default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Knessl
Person information
- affiliation: University of Illinois at Chicago, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[j81]Eunju Sohn
, Charles Knessl:
Asymptotic Analysis of a Storage Allocation Model with Finite Capacity: Joint Distribution. Adv. Oper. Res. 2016: 1925827:1-1925827:56 (2016)- 2015
- [j80]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): 205-231 (2015) - [j79]Charles Knessl, Johan van Leeuwaarden:
Transient analysis of the Erlang A model. Math. Methods Oper. Res. 82(2): 143-173 (2015) - 2014
- [j78]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): 829-841 (2014) - [j77]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): 109-110 (2014) - [j76]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): 189-195 (2014) - [c8]Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. ANALCO 2014: 16-24 - 2013
- [j75]Charles Knessl, Haishen Yao:
On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits. Adv. Oper. Res. 2013: 680539:1-680539:21 (2013) - [j74]Qiang Zhen, Charles Knessl:
On spectral properties of finite population processor shared queues. Math. Methods Oper. Res. 77(2): 147-176 (2013) - [j73]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): 235-272 (2013) - 2012
- [j72]Yongwook Choi, Charles Knessl, Wojciech Szpankowski:
On a Recurrence Arising in Graph Compression. Electron. J. Comb. 19(3): 15 (2012) - [j71]Philippe Jacquet, Charles Knessl, Wojciech Szpankowski:
Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Trans. Inf. Theory 58(7): 4261-4272 (2012) - 2011
- [j70]Charles Knessl, John A. Morrison:
Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case. Adv. Oper. Res. 2011: 216790:1-216790:26 (2011) - [j69]Miao Xu, Charles Knessl:
On a free boundary problem for an American put option under the CEV process. Appl. Math. Lett. 24(7): 1191-1198 (2011) - [j68]Charles Knessl, Mark W. Coffey:
An effective asymptotic formula for the Stieltjes constants. Math. Comput. 80(273): 379-386 (2011) - [j67]Charles Knessl, Mark W. Coffey:
An asymptotic form for the Stieltjes constants gammak(a) and for a sum Sgamma(n) appearing under the Li criterion. Math. Comput. 80(276): 2197-2217 (2011) - [j66]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): 1220-1240 (2011) - [c7]Eunju Sohn, Charles Knessl:
On some simple single server models of dynamic storage. QTNA 2011: 161-168 - 2010
- [j65]Qiang Zhen, Charles Knessl:
Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. Math. Methods Oper. Res. 71(2): 201-244 (2010) - [j64]Qiang Zhen, Johan van Leeuwaarden, Charles Knessl:
On a processor sharing queue that models balking. Math. Methods Oper. Res. 72(3): 453-476 (2010) - [j63]Eunju Sohn, Charles Knessl:
Storage allocation under processor sharing I: exact solutions and asymptotics. Queueing Syst. Theory Appl. 65(1): 1-18 (2010) - [c6]Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden:
Wireless multi-hop networks with stealing: Large buffer asymptotics. ITC 2010: 1-8
2000 – 2009
- 2009
- [j62]Qiang Zhen, Charles Knessl:
On sojourn times in the finite capacity M/M/1 queue with processor sharing. Oper. Res. Lett. 37(6): 447-450 (2009) - [j61]Charles Knessl, John A. Morrison:
A Two-Dimensional Diffusion Approximation for a Loss Model with Trunk Reservation. SIAM J. Appl. Math. 69(5): 1457-1476 (2009) - [j60]Sean Lynch, Charles Knessl:
Drift-Diffusion Past a Circle: Shadow Region Asymptotics. SIAM J. Appl. Math. 69(6): 1559-1579 (2009) - 2008
- [j59]Eunju Sohn, Charles Knessl:
A simple direct solution to a storage allocation model. Appl. Math. Lett. 21(2): 172-175 (2008) - [j58]Charles Knessl:
On the number of reachable configurations for the chessboard pebbling problem. Math. Comput. Model. 47(1-2): 127-139 (2008) - [j57]Haishen Yao, Charles Knessl:
Some first passage time problems for the shortest queue model. Queueing Syst. Theory Appl. 58(2): 105-119 (2008) - 2007
- [j56]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): 157-168 (2007) - 2006
- [j55]Charles Knessl, Yongzhi (Peter) Yang:
On the Erlang Loss Model with Time Dependent Input. Queueing Syst. Theory Appl. 52(1): 49-104 (2006) - [j54]Haishen Yao, Charles Knessl:
On the infinite server shortest queue problem: Non-symmetric case. Queueing Syst. Theory Appl. 52(2): 157-177 (2006) - [j53]Diego Dominici, Charles Knessl:
Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks. SIAM J. Appl. Math. 66(6): 1871-1894 (2006) - [c5]Charles Knessl, Wojciech Szpankowski:
Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. ANALCO 2006: 198-204 - 2005
- [j52]Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees and Universal Types. Discret. Math. Theor. Comput. Sci. 7(1): 313-400 (2005) - [j51]Charles Knessl, John A. Morrison:
Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation. SIAM J. Appl. Math. 66(1): 82-97 (2005) - [c4]Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO 2005: 222-229 - 2004
- [j50]Diego Dominici, Charles Knessl:
A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models. Appl. Math. Lett. 17(5): 535-542 (2004) - [j49]Charles Knessl:
Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers. Queueing Syst. Theory Appl. 47(3): 201-250 (2004) - [j48]Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004) - 2003
- [j47]Charles Knessl:
Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. Discret. Math. Theor. Comput. Sci. 6(1): 91-100 (2003) - [j46]Charles Knessl, John A. Morrison:
Heavy Traffic Analysis of Two Coupled Processors. Queueing Syst. Theory Appl. 43(3): 221-250 (2003) - [j45]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): 398-422 (2003) - 2002
- [j44]Charles Knessl, Wojciech Szpankowski:
Limit laws for the height in PATRICIA tries. J. Algorithms 44(1): 63-97 (2002) - [j43]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): 233-245 (2002) - [j42]Charles Knessl, Wojciech Szpankowski:
The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. 289(1): 649-703 (2002) - 2001
- [j41]Charles Knessl:
Geometrical optics and chessboard pebbling. Appl. Math. Lett. 14(3): 365-373 (2001) - [j40]Charles Knessl, Yongzhi (Peter) Yang:
Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue. Queueing Syst. Theory Appl. 39(2/3): 213-256 (2001) - [j39]Charles Knessl:
On Two-Dimensional Convection-Diffusion Past a Circle. SIAM J. Appl. Math. 62(1): 310-335 (2001) - [j38]Charles Knessl, Charles Tier:
A simple fluid model for servicing priority traffic. IEEE Trans. Autom. Control. 46(6): 909-914 (2001) - 2000
- [j37]Charles Knessl, Wojciech Szpankowski:
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electron. J. Comb. 7 (2000) - [j36]Charles Knessl, Joseph B. Keller:
Probability of Brownian Motion Hitting an Obstacle. SIAM J. Appl. Math. 60(2): 729-745 (2000) - [j35]Charles Knessl:
Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems. SIAM J. Appl. Math. 61(3): 914-933 (2000) - [j34]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): 923-964 (2000) - [c3]Charles Knessl, Wojciech Szpankowski:
Heights in Generalized Tries and PATRICIA Tries. LATIN 2000: 298-307 - [c2]Charles Knessl, Wojciech Szpankowski:
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA 2000: 187-196
1990 – 1999
- 1999
- [j33]Charles Knessl, Wojciech Szpankowski:
Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. 3(2): 43-64 (1999) - [j32]Charles Knessl, Charles Tier:
Two Tandem Queues with General Renewal Input I: Diffusion Approximation and Integral Representations. SIAM J. Appl. Math. 59(6): 1917-1959 (1999) - [j31]Charles Knessl, Charles Tier:
Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model. SIAM J. Appl. Math. 59(6): 1960-1997 (1999) - 1998
- [j30]Charles Knessl:
A Note on the Asymptotic Behavior of the Depth of Tries. Algorithmica 22(4): 547-560 (1998) - [j29]Charles Knessl, Charles Tier:
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. Perform. Evaluation 33(4): 219-248 (1998) - [j28]Charles Knessl:
An explicit solution to a tandem queueing model. Queueing Syst. Theory Appl. 30(3-4): 261-272 (1998) - [j27]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): 257-323 (1998) - [c1]Charles Knessl, Wojciech Szpankowski:
Quicksort Again Revisited. RANDOM 1998: 345-356 - 1997
- [j26]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): 23-68 (1997) - [j25]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): 791-823 (1997) - [j24]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): 824-870 (1997) - 1996
- [j23]Xiaoming Tan, Charles Knessl:
A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics. Queueing Syst. Theory Appl. 22(3-4): 287-322 (1996) - [j22]Charles Knessl, Craig Steven Peters:
Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin II. SIAM J. Appl. Math. 56(5): 1471-1521 (1996) - 1994
- [j21]Charles Knessl:
Asymptotic behavior of high-order differences of the plane partition function. Discret. Math. 126(1-3): 179-193 (1994) - [j20]Charles Knessl:
On the Distribution of the Maximum Number of Broken Machines for the Repairman Problem. SIAM J. Appl. Math. 54(2): 508-547 (1994) - [j19]Charles Knessl, Charles Tier:
A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics. SIAM J. Appl. Math. 54(3): 854-875 (1994) - [j18]Charles Knessl, Craig Steven Peters:
Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin I. SIAM J. Appl. Math. 54(6): 1745-1767 (1994) - [j17]Xiaoming Tan, Charles Knessl:
Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times. SIAM J. Appl. Math. 54(6): 1768-1779 (1994) - 1993
- [j16]Charles Knessl:
On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. J. ACM 40(5): 1238-1301 (1993) - [j15]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): 99-109 (1993) - [j14]Xiaoming Tan, Charles Knessl:
A Finite Capacity PS Queue Which Models Switching Times. SIAM J. Appl. Math. 53(2): 491-554 (1993) - [j13]Shisheng Xie, Charles Knessl:
On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics. SIAM J. Appl. Math. 53(2): 555-599 (1993) - [j12]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): 1132-1193 (1993) - 1992
- [j11]Charles Knessl, Charles Tier:
Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. IEEE Trans. Computers 41(4): 480-488 (1992) - 1991
- [j10]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): 165-182 (1991) - 1990
- [j9]Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier:
An Integral Equation Approach to the M/G/2 Queue. Oper. Res. 38(3): 506-518 (1990) - [j8]Charles Knessl:
Refinements to Heavy Traffic Limit Theorems in Queueing Theory. Oper. Res. 38(5): 826-837 (1990) - [j7]Charles Knessl, Charles Tier:
Asymptotic Expansions for Large Closed Queuing Networks. J. ACM 37(1): 144-174 (1990)
1980 – 1989
- 1987
- [j6]Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
Busy Period Distribution in State-Dependent Queues. Queueing Syst. Theory Appl. 2(3): 285-305 (1987) - [j5]Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
Asymptotic Expansions for a Closed Multiple Access System. SIAM J. Comput. 16(2): 378-398 (1987) - [j4]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): 1153-1158 (1987) - 1986
- [j3]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): 355-374 (1986) - [j2]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): 375-399 (1986) - [j1]Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier:
Two Parallel Queues with Dynamic Routing. IEEE Trans. Commun. 34(12): 1170-1175 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
