Wojciech Szpankowski | Researcher Profile | Sotabase

Career

· Professor, Jagiellonian University2022–

· Guest Professor, ETH Zurich2013–

· Professor, Republic of Poland2007–

· Erskine Fellow, University of Canterbury2006–

· Visiting Professor, Stanford University1999–

· Professeur Invite, INRIA1992–

· Saul Rosen Distinguished Professor of Computer Science, Purdue University1985–

· Assistant Professor, McGill University1984–

· Assistant Professor, Technical University of Gdansk1980–

· MS and PhD in Electrical Engineering and Computer Science, Technical University of Gdańsk1970–1980

Publications (389)

Average Case Analysis of Algorithms on Sequences

2001

547

cited

Pairwise Alignment of Protein Interaction Networks

J. Comput. Biol. · 2006

281

cited

An efficient algorithm for detecting frequent subgraphs in biological networks

ISMB/ECCB · 2004

225

cited

Stability conditions for some distributed systems: buffered random access systems

Advances in Applied Probability · 1994

222

cited

Average Case Analysis of Algorithms on Sequences: Szpankowski/Average

2001

198

cited

Analytical Depoissonization and its Applications

Theoretical Computer Science · 1998

176

cited

Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees

Theoretical Computer Science · 1995

136

cited

A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors

SIAM journal on computing (Print) · 1993

126

cited

Reliable detection of episodes in event sequences

Third IEEE International Conference on Data Mining · 2003

124

cited

On the entropy of a hidden Markov process

Data Compression Conference, 2004. Proceedings. DCC 2004 · 2004

123

cited

Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

IEEE Transactions on Information Theory · 2012

121

cited

On Pattern Frequency Occurrences in a Markovian Sequence

Proceedings of IEEE International Symposium on Information Theory · 1997

120

cited

A suboptimal lossy data compression based on approximate pattern matching

IEEE Transactions on Information Theory · 1997

116

cited

Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach

Journal of Combinatorial Theory · 1994

103

cited

Precise minimax redundancy and regret

IEEE Transactions on Information Theory · 2004

cited

Detecting Conserved Interaction Patterns in Biological Networks

J. Comput. Biol. · 2006

cited

Analysis of digital tries with Markovian dependency

IEEE Transactions on Information Theory · 1991

cited

Entropy Computations via Analytic Depoissonization

IEEE Transactions on Information Theory · 1999

cited

Asymptotic properties of data compression and suffix trees

IEEE Transactions on Information Theory · 1993

cited

Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution

Annual International Conference on Research in Computational Molecular Biology · 2005

cited

Sotabase