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="Szpankowski, W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average profile of the Lempel-Ziv parsing scheme for a Markovian source
P. Jacquet
,
W. Szpankowski
,
J. Tang
Algorithmica
31
(3), 2001, pp. 318-360
Greedy algorithms for the shortest common superstring that are asymptotically optimal
A. Frieze
,
W. Szpankowski
Algorithmica
21
(1), 1998, pp. 21-36
Philippe Flajolet's research in analysis of algorithms and combinatorics
H. Prodinger
,
W. Szpankowski
Algorithmica
22
(4), 1998, pp. 366-387
On pattern frequency occurrences in a Markovian sequence
M. Régnier
,
W. Szpankowski
Algorithmica
22
(4), 1998, pp. 631-649
Do we really need to balance Patricia tries
P. Kirschenhofer
,
H. Prodinger
,
W. Szpankowski
Lecture Notes in Computer Science
317
, 1988, pp. 302-316
Some results on V-ary asymmetric tries
W. Szpankowski
Journal of Algorithms
9
(2), 1988, June, pp. 224-244
The evaluation of an alternative sum with applications to the analysis of some data structures
W. Szpankowski
Information Processing Letters
28
(1), 1988, May, pp. 13-19
On an alternative sum useful in the analysis of some data structures
W. Szpankowski
Lecture Notes in Computer Science
318
, 1988, pp. 120-128
An analysis of a contention resolution algorithm: another approach
W. Szpankowski
Acta Informatica
24
(2), 1987, pp. 173-190
On an asymptotic analysis of a tree-type algorithm for broadcast communications
W. Szpankowski
Information Processing Letters
23
(3), 1986, October, pp. 135-142