| Average case analysis of algorithms on sequences W Szpankowski John Wiley & Sons, 2011 | 676 | 2011 |
| Pairwise alignment of protein interaction networks M Koyutürk, Y Kim, U Topkara, S Subramaniam, W Szpankowski, ... Journal of Computational Biology 13 (2), 182-199, 2006 | 345 | 2006 |
| Stability conditions for some distributed systems: Buffered random access systems W Szpankowski Advances in Applied Probability 26 (2), 498-515, 1994 | 315 | 1994 |
| An efficient algorithm for detecting frequent subgraphs in biological networks M Koyutürk, A Grama, W Szpankowski Bioinformatics 20 (suppl_1), i200-i207, 2004 | 265 | 2004 |
| Analytical depoissonization and its applications P Jacquet, W Szpankowski Theoretical Computer Science 201 (1-2), 1-62, 1998 | 247 | 1998 |
| Reliable detection of episodes in event sequences R Gwadera, MJ Atallah, W Szpankowski Knowledge and Information Systems 7, 415-437, 2005 | 162 | 2005 |
| Analysis of algorithms P Flajolet, W Szpankowski Random Structures & Algorithms 10 (1‐2), 1-3, 1997 | 160 | 1997 |
| Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees P Jacquet, W Szpankowski Theoretical Computer Science 144 (1-2), 161-197, 1995 | 159 | 1995 |
| A suboptimal lossy data compression based on approximate pattern matching T Luczak, W Szpankowski IEEE transactions on Information Theory 43 (5), 1439-1451, 1997 | 146* | 1997 |
| On pattern frequency occurrences in a Markovian sequence M Régnier, W Szpankowski Algorithmica 22, 631-649, 1998 | 141 | 1998 |
| A generalized suffix tree and its (un) expected asymptotic behaviors W Szpankowski SIAM Journal on Computing 22 (6), 1176-1198, 1993 | 140 | 1993 |
| On the average redundancy rate of the Lempel-Ziv code G Louchard, W Szpankowski IEEE Transactions on Information Theory 43 (1), 2-8, 1997 | 125 | 1997 |
| Compression of graphical structures: Fundamental limits, algorithms, and experiments Y Choi, W Szpankowski IEEE Transactions on Information Theory 58 (2), 620-638, 2012 | 122 | 2012 |
| Precise minimax redundancy and regret M Drmota, W Szpankowski IEEE Transactions on Information Theory 50 (11), 2686-2707, 2004 | 118 | 2004 |
| Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach P Jacquet, W Szpankowski Journal of Combinatorial Theory, Series A 66 (2), 237-269, 1994 | 118 | 1994 |
| On the entropy of a hidden Markov process P Jacquet, G Seroussi, W Szpankowski Theoretical computer science 395 (2-3), 203-219, 2008 | 115 | 2008 |
| Detecting conserved interaction patterns in biological networks M Koyutürk, Y Kim, S Subramaniam, W Szpankowski, A Grama Journal of Computational Biology 13 (7), 1299-1322, 2006 | 114 | 2006 |
| Patricia tries again revisited W Szpankowski Journal of the ACM (JACM) 37 (4), 691-711, 1990 | 114 | 1990 |
| Analysis of digital tries with Markovian dependency P Jacquet, W Szpankowski IEEE Transactions on Information Theory 37 (5), 1470-1475, 1991 | 109 | 1991 |
| Asymptotic properties of data compression and suffix trees W Szpankowski IEEE transactions on Information Theory 39 (5), 1647-1659, 1993 | 106 | 1993 |
