Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Knessl, Charles"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Limit laws for the height in PATRICIA tries
Charles Knessl
,
Wojciech Szpankowski
Journal of Algorithms
44
(1), 2002, pp. 63-97
The height of a binary search tree: The limiting distribution perspective
Charles Knessl
,
Wojciech Szpankowski
Theoretical Computer Science
289
(1), 2002, pp. 649-703
Asymptotic behavior of the height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
Charles Knessl
,
Wojciech Szpankowski
SIAM Journal on Computing
30
(3), 2000, pp. 923-964
Quicksort algorithm again revisited
Charles Knessl
,
Wojciech Szpankowski
Discrete Mathematics and Theoretical Computer Science
3
, 1999, pp. 43-64
Quicksort again revisited
Charles Knessl
,
Wojciech Szpankowski
Lecture Notes in Computer Science
1518
, 1998, pp. 346-356
On the sojourn time distribution in a finite capacity processor shared queue
Charles Knessl
Journal of the ACM
40
(5), 1993, November, pp. 1238-1301
Asymptotic expansions for large closed queueing networks
Charles Knessl
,
Charles Tier
Journal of the ACM
37
(1), 1990, January, pp. 144-174