- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j53 |      | Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden: Wireless three-hop networks with stealing II: exact solutions through boundary value problems. Queueing Syst. 74(2-3): 235-272 (2013) |
| 2012 | ||
| j52 | | Philippe Jacquet, Charles Knessl, Wojciech Szpankowski: Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Transactions on Information Theory 58(7): 4261-4272 (2012) |
| 2011 | ||
| j51 | | Charles Knessl, John A. Morrison: Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case. Adv. Operations Research 2011 (2011) |
| j50 | | 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) |
| j49 | | Charles Knessl, Mark W. Coffey: An effective asymptotic formula for the Stieltjes constants. Math. Comput. 80(273): 379-386 (2011) |
| j48 | | 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) |
| j47 | | Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden: Wireless Multihop Networks with Stealing: Large Buffer Asymptotics via the Ray Method. SIAM Journal of Applied Mathematics 71(4): 1220-1240 (2011) |
| 2010 | ||
| j46 | | Qiang Zhen, Charles Knessl: Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. Math. Meth. of OR 71(2): 201-244 (2010) |
| j45 | | Qiang Zhen, Johan van Leeuwaarden, Charles Knessl: On a processor sharing queue that models balking. Math. Meth. of OR 72(3): 453-476 (2010) |
| j44 | | Eunju Sohn, Charles Knessl: Storage allocation under processor sharing I: exact solutions and asymptotics. Queueing Syst. 65(1): 1-18 (2010) |
| c6 | | Fabrice Guillemin, Charles Knessl, Johan van Leeuwaarden: Wireless multi-hop networks with stealing: Large buffer asymptotics. International Teletraffic Congress 2010: 1-8 |
| 2009 | ||
| j43 | | 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) |
| j42 | | Charles Knessl, John A. Morrison: A Two-Dimensional Diffusion Approximation for a Loss Model with Trunk Reservation. SIAM Journal of Applied Mathematics 69(5): 1457-1476 (2009) |
| j41 | | Sean Lynch, Charles Knessl: Drift-Diffusion Past a Circle: Shadow Region Asymptotics. SIAM Journal of Applied Mathematics 69(6): 1559-1579 (2009) |
| 2008 | ||
| j40 | | Eunju Sohn, Charles Knessl: A simple direct solution to a storage allocation model. Appl. Math. Lett. 21(2): 172-175 (2008) |
| j39 | | Charles Knessl: On the number of reachable configurations for the chessboard pebbling problem. Mathematical and Computer Modelling 47(1-2): 127-139 (2008) |
| j38 | | Haishen Yao, Charles Knessl: Some first passage time problems for the shortest queue model. Queueing Syst. 58(2): 105-119 (2008) |
| 2007 | ||
| j37 | | Qiang Zhen, Charles Knessl: Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Syst. 57(4): 157-168 (2007) |
| 2006 | ||
| j36 | | Charles Knessl, Yongzhi (Peter) Yang: On the Erlang Loss Model with Time Dependent Input. Queueing Syst. 52(1): 49-104 (2006) |
| j35 | | Haishen Yao, Charles Knessl: On the infinite server shortest queue problem: Non-symmetric case. Queueing Syst. 52(2): 157-177 (2006) |
| j34 | | Diego Dominici, Charles Knessl: Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks. SIAM Journal of Applied Mathematics 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 | ||
| j33 | | Charles Knessl, Wojciech Szpankowski: Enumeration of Binary Trees and Universal Types. Discrete Mathematics & Theoretical Computer Science 7(1): 313-400 (2005) |
| j32 | | Charles Knessl, John A. Morrison: Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation. SIAM Journal of Applied Mathematics 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 | ||
| j31 | | 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) |
| j30 | | Charles Knessl: Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers. Queueing Syst. 47(3): 201-250 (2004) |
| j29 | | Charles Knessl, Wojciech Szpankowski: On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004) |
| 2003 | ||
| j28 | | Charles Knessl: Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. Discrete Mathematics & Theoretical Computer Science 6(1): 91-100 (2003) |
| j27 | | Charles Knessl, John A. Morrison: Heavy Traffic Analysis of Two Coupled Processors. Queueing Syst. 43(3): 221-250 (2003) |
| j26 | | Charles Knessl, Charles Tier, Doo Il Choi: A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types. SIAM Journal of Applied Mathematics 63(2): 398-422 (2003) |
| 2002 | ||
| j25 | | Charles Knessl, Wojciech Szpankowski: Limit laws for the height in PATRICIA tries. J. Algorithms 44(1): 63-97 (2002) |
| j24 | | Charles Knessl, Yongzhi (Peter) Yang: An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service. Queueing Syst. 40(3): 233-245 (2002) |
| j23 | | Charles Knessl, Wojciech Szpankowski: The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. 289(1): 649-703 (2002) |
| 2001 | ||
| j22 | | |
| j21 | | Charles Knessl, Yongzhi (Peter) Yang: Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue. Queueing Syst. 39(2/3): 213-256 (2001) |
| j20 | | Charles Knessl: On Two-Dimensional Convection-Diffusion Past a Circle. SIAM Journal of Applied Mathematics 62(1): 310-335 (2001) |
| 2000 | ||
| j19 | | Charles Knessl, Wojciech Szpankowski: A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electr. J. Comb. 7 (2000) |
| j18 | | Charles Knessl: Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems. SIAM Journal of Applied Mathematics 61(3): 914-933 (2000) |
| j17 | | 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 |
| 1999 | ||
| j16 | | Charles Knessl, Wojciech Szpankowski: Quicksort Algorithm Again Revisited. Discrete Mathematics & Theoretical Computer Science 3(2): 43-64 (1999) |
| 1998 | ||
| j15 | | Charles Knessl: A Note on the Asymptotic Behavior of the Depth of Tries. Algorithmica 22(4): 547-560 (1998) |
| j14 | | Charles Knessl, Charles Tier: Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. Perform. Eval. 33(4): 219-248 (1998) |
| j13 | | Charles Knessl: An explicit solution to a tandem queueing model. Queueing Syst. 30(3-4): 261-272 (1998) |
| c1 | | |
| 1997 | ||
| j12 | | Yongzhi (Peter) Yang, Charles Knessl: Asymptotic Analysis of the M/G/1 Queue with a Time-Dependent Arrival Rate. Queueing Syst. 26(1-2): 23-68 (1997) |
| 1996 | ||
| j11 | | Xiaoming Tan, Charles Knessl: A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics. Queueing Syst. 22(3-4): 287-322 (1996) |
| 1994 | ||
| j10 | | Charles Knessl: Asymptotic behavior of high-order differences of the plane partition function. Discrete Mathematics 126(1-3): 179-193 (1994) |
| 1993 | ||
| j9 | | Charles Knessl: On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. J. ACM 40(5): 1238-1301 (1993) |
| j8 | | 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. 14(1-2): 99-109 (1993) |
| 1992 | ||
| j7 | | Charles Knessl, Charles Tier: Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. IEEE Trans. Computers 41(4): 480-488 (1992) |
| 1991 | ||
| j6 | | Charles Knessl, John A. Morrison: Heavy-Traffic Analysis of the Sojourn Time in a Three Node Jackson Network with Overtaking. Queueing Syst. 8(2): 165-182 (1991) |
| 1990 | ||
| j5 | | Charles Knessl, Charles Tier: Asymptotic Expansions for Large Closed Queuing Networks. J. ACM 37(1): 144-174 (1990) |
| 1987 | ||
| j4 | | Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier: Busy Period Distribution in State-Dependent Queues. Queueing Syst. 2(3): 285-305 (1987) |
| j3 | | Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier: Asymptotic Expansions for a Closed Multiple Access System. SIAM J. Comput. 16(2): 378-398 (1987) |
| 1986 | ||
| j2 | | Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier: A Markov-Modulated M/G/1 Queue I: Stationary Distribution. Queueing Syst. 1(4): 355-374 (1986) |
| j1 | | Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier: A Markov-Modulated M/G/1 Queue II: Busy Period and Time for Buffer Overflow. Queueing Syst. 1(4): 375-399 (1986) |
Colors in the list of coauthors
Last update Sun May 19 03:32:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page