default search action
Charles Knessl
- > Home > Persons > Charles Knessl
Publications
- 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) - [c8]Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. ANALCO 2014: 16-24 - 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) - 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) - [c4]Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO 2005: 222-229 - 2004
- [j48]Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004) - 2002
- [j44]Charles Knessl, Wojciech Szpankowski:
Limit laws for the height in PATRICIA tries. J. Algorithms 44(1): 63-97 (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) - 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) - [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 - 1999
- [j33]Charles Knessl, Wojciech Szpankowski:
Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. 3(2): 43-64 (1999) - 1998
- [c1]Charles Knessl, Wojciech Szpankowski:
Quicksort Again Revisited. RANDOM 1998: 345-356
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