The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Charles Knessl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles Knessl, Wojciech Szpankowski
    Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:222-229 [Conf]
  2. Charles Knessl, Wojciech Szpankowski
    Heights in Generalized Tries and PATRICIA Tries. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:298-307 [Conf]
  3. Charles Knessl, Wojciech Szpankowski
    Quicksort Again Revisited. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:345-356 [Conf]
  4. Charles Knessl, Wojciech Szpankowski
    Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:187-196 [Conf]
  5. Charles Knessl
    A Note on the Asymptotic Behavior of the Depth of Tries. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:547-560 [Journal]
  6. Diego Dominici, Charles Knessl
    A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2004, v:17, n:5, pp:535-542 [Journal]
  7. Charles Knessl
    Geometrical optics and chessboard pebbling. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2001, v:14, n:3, pp:365-373 [Journal]
  8. Charles Knessl, Wojciech Szpankowski
    A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  9. Charles Knessl
    Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:91-100 [Journal]
  10. Charles Knessl, Wojciech Szpankowski
    Quicksort Algorithm Again Revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:2, pp:43-64 [Journal]
  11. Charles Knessl
    On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1238-1301 [Journal]
  12. Charles Knessl, Charles Tier
    Asymptotic Expansions for Large Closed Queuing Networks [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:1, pp:144-174 [Journal]
  13. Charles Knessl, Wojciech Szpankowski
    Limit laws for the height in PATRICIA tries. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:1, pp:63-97 [Journal]
  14. Charles Knessl, Charles Tier
    Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1998, v:33, n:4, pp:219-248 [Journal]
  15. Charles Knessl
    Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2004, v:47, n:3, pp:201-250 [Journal]
  16. Charles Knessl
    An explicit solution to a tandem queueing model. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1998, v:30, n:3-4, pp:261-272 [Journal]
  17. Charles Knessl, John A. Morrison
    Heavy Traffic Analysis of Two Coupled Processors. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2003, v:43, n:3, pp:221-250 [Journal]
  18. Charles Knessl, John A. Morrison
    Heavy-Traffic Analysis of the Sojourn Time in a Three Node Jackson Network with Overtaking. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1991, v:8, n:2, pp:165-182 [Journal]
  19. Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier
    A Markov-Modulated M/G/1 Queue I: Stationary Distribution. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1986, v:1, n:4, pp:355-374 [Journal]
  20. Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier
    A Markov-Modulated M/G/1 Queue II: Busy Period and Time for Buffer Overflow. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1986, v:1, n:4, pp:375-399 [Journal]
  21. Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier
    Busy Period Distribution in State-Dependent Queues. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1987, v:2, n:3, pp:285-305 [Journal]
  22. Charles Knessl, Yongzhi (Peter) Yang
    Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2001, v:39, n:2/3, pp:213-256 [Journal]
  23. Charles Knessl, Yongzhi (Peter) Yang
    An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2002, v:40, n:3, pp:233-245 [Journal]
  24. Charles Knessl, Yongzhi (Peter) Yang
    On the Erlang Loss Model with Time Dependent Input. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2006, v:52, n:1, pp:49-104 [Journal]
  25. Yongzhi (Peter) Yang, Charles Knessl
    Asymptotic Analysis of the M/G/1 Queue with a Time-Dependent Arrival Rate. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1997, v:26, n:1-2, pp:23-68 [Journal]
  26. X. Tan, Charles Knessl
    A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1996, v:22, n:3-4, pp:287-322 [Journal]
  27. Haishen Yao, Charles Knessl
    On the infinite server shortest queue problem: Non-symmetric case. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2006, v:52, n:2, pp:157-177 [Journal]
  28. Charles Knessl, Wojciech Szpankowski
    On the number of full levels in tries. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:247-276 [Journal]
  29. Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier
    Asymptotic Expansions for a Closed Multiple Access System. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:378-398 [Journal]
  30. Charles Knessl, Wojciech Szpankowski
    Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:923-964 [Journal]
  31. Charles Knessl, Charles Tier
    Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:4, pp:480-488 [Journal]
  32. Charles Knessl, Wojciech Szpankowski
    The height of a binary search tree: the limiting distribution perspective. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:649-703 [Journal]
  33. Charles Knessl
    Asymptotic behavior of high-order differences of the plane partition function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:179-193 [Journal]
  34. Charles Knessl, Wojciech Szpankowski
    Enumeration of Binary Trees and Universal Types. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:313-400 [Journal]
  35. Diego Dominici, Charles Knessl
    Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks. [Citation Graph (0, 0)][DBLP]
    SIAM Journal of Applied Mathematics, 2006, v:66, n:6, pp:1871-1894 [Journal]
  36. Charles Knessl, John A. Morrison
    Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation. [Citation Graph (0, 0)][DBLP]
    SIAM Journal of Applied Mathematics, 2005, v:66, n:1, pp:82-97 [Journal]

  37. A simple direct solution to a storage allocation model. [Citation Graph (, )][DBLP]


Search in 0.179secs, Finished in 0.181secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002