M. Regnier and W. Szpankowski. On Pattern Frequency Occurrences in a Markovian Sequence. In Algorithmica, October 1998.

A. Frieze and W. Szpankowski. Greedy Algorithms for the Shortest Common Superstring Problem that are Asymptotically Optimal. Algorithmica, 21:21-36, 1998.

P. Jacquet and W. Szpankowski. Analytical Depoissonization and Its Applications. Theoretical Computer Science, 201(1-2):1-62, 1998. In Fundamental Studies Section.

W. Szpankowski. On Asymptotics of Certain Recurrences Arising in Universal Coding. Problems of Information Transmission, 34(2):55-61, 1998.

C. Knessl and W. Szpankowski. Quicksort Algorithm Again Revisited. In Discrete Mathematics and Theoretical Computer Science, 1998.

G. Louchard, W. Szpankowski, and J. Tang. Average Profile for the Generalized Digital Search Trees and the Generalized Lempel-Ziv Algorithm. In SIAM Journal on Computing, 1998.

E. Sutinen and W. Szpankowski. On the Collapse of the q-Gram Filtration. In Proceedings of the International Conference on FUN with Algorithms, Elba, Italy, 1998.

W. Szpankowski. On Asymptotics of the Minimax Redundancy Arising in a Universal Coding. In 1998 International Symposium on Information Theory, Boston, 1998.

P. Jacquet and W. Szpankowski. Entropy Computations for Discrete Distributions: Towards Analytic Information Theory. In 1998 International Symposium on Information Theory, Boston, 1998.

M. Regnier and W. Szpankowski. Complexity of Sequential Pattern Matching Algorithms. In Proceedings of Randomization and Approximate Techniques in Computer Science, RANDOM'98, pages 187-199, Barcelona, Spain, 1998. LCNS No. 1518.

C. Knessl and W. Szpankowski. Quicksort Algorithm Again Revisited. In Proceedings of Randomization and Approximate Techniques in Computer Science, RANDOM'98, pages 346-356, Barcelona, Spain, 1998. LCNS No. 1518.

H. Prodinger and W. Szpankowski. Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica, 22:366-387, 1998.

T. Luczak and W. Szpankowski. A Suboptimal Loosy Data Compression Based on Approximate Pattern Matching. IEEE Transactions on Information Theory, 43:1439-1451, 1997.

S. Janson and W. Szpankowski. Analysis of an Asymmetric Leader Election Algorithm. Electronic Journal of Combinatorics, 4(R17), 1997.