Szpankowski earned his master's degree in electrical engineering and computer science in 1976, and his doctorate in same discipline in 1980, both from the Technical University of Gdansk in Poland.
Several visiting professor/scholar positions, including at McGill University, the French National Institute for Research in Computer Science, Stanford University, Hewlett-Packard Labs, Universite de Versailles, University of Canterbury, New Zealand, and Poznan University of Technology in Poland. In 2008, together with his Purdue colleagues, Szpankowski launched the Institute for Science of Information to advance a novel framework for information.
Algorithms, Data Compression, Information Theory, Analytic Combinatorics, Random Structures, Networking, Stability Problems in Distributed Systems, Modeling of Computer Systems and Computer Communication Networks, Queueing Theory, and Operations Research.
Guest editor for special issues in IEEE Transactions on Automatic Control,Theoretical Computer Science, Random Structures & Algorithms, and Algorithmica. Currently editing a special issue on "Analysis of Algorithms" in Algorithmica. Serves on the editorial boards of Theoretical Computer Science, Discrete Mathematics and Theoretical Computer Science, and book series Advances in the Theory of Computation and Computational Mathematics.
Saul Rosen Professor of Computer Science
Recipient of the Humboldt Fellowship, IEEE Fellow
Detection of Significant Sets of Episodes in Event Sequences (with R. Gwadera and M. Atallah), Fourth IEEE International Conference on Data Mining (UK, 2004). More than 140 publications in refereed journals and conferences, in addition to a book and book chapters.
Before coming to Purdue, W. Szpankowski was Assistant Professor at the Technical University of Gdansk, and in 1984 he was Assistant Professor at the McGill University, Montreal. During 1992/1993 he was Professeur Invité at INRIA, Rocquencourt, France. His research interests cover analysis of algorithms, data compression, information theory, analytic combinatorics, random structures, networking, stability problems in distributed systems, modeling of computer systems and computer communication networks, queueing theory, and operations research. His recent work is devoted to the probabilistic analysis of algorithms on words, analytic information theory, and designing efficient multimedia data compression schemes based on approximate pattern matching. He is a recipient of the Humboldt Fellowship. He has been guest editors for special issues in IEEE Transactions on Automatic Control, Theoretical Computer Science, Random Structures & Algorithms, and Algorithmica. Currently, he is editing a special issue on "Analysis of Algorithms" in Algorithmica. He serves on the editorial boards of Theoretical Computer Science, Discrete Mathematics and Theoretical Computer Science, and book series Advances in the Theory of Computation and Computational Mathematics.