Wojciech Szpankowski

Ralph Neininger, Kevin Leckey, Wojciech Szpankowski: Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. SODA 2013: 877-886

Markus E. Nebel, Wojciech Szpankowski (Eds.): Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. SIAM 2013

Yongwook Choi, Wojciech Szpankowski: Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments. IEEE Transactions on Information Theory 58(2): 620-638 (2012)

Wojciech Szpankowski, Marcelo J. Weinberger: Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets. IEEE Transactions on Information Theory 58(7): 4094-4104 (2012)

Philippe Jacquet, Charles Knessl, Wojciech Szpankowski: Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Transactions on Information Theory 58(7): 4261-4272 (2012)

Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood. IEEE Transactions on Information Theory 58(12): 7094-7109 (2012)

Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan: Mutual information for a deletion channel. ISIT 2012: 2561-2565

Jacek Cichon, Jakub Lemiesz, Wojciech Szpankowski, Marcin Zawada: Two-phase cardinality estimation protocols for sensor networks with provable precision. WCNC 2012: 2009-2013

Kevin Leckey, Ralph Neininger, Wojciech Szpankowski: Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. CoRR abs/1207.0302 (2012)

Neri Merhav, Wojciech Szpankowski: Average redundancy of the Shannon code for Markov sources. CoRR abs/1208.1225 (2012)

Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: Philippe Flajolet 1 December 1948 - 22 March 2011. Combinatorics, Probability & Computing 20(5): 647-649 (2011)

Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: Philippe Flajolet (1948-2011). Bulletin of the EATCS 104: 16-18 (2011)

Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: In memoriam: Philippe Flajolet, the father of analytic combinatorics. RAIRO - Theor. Inf. and Applic. 45(4): 371-373 (2011)

Michael Drmota, Wojciech Szpankowski: The expected profile of digital search trees. J. Comb. Theory, Ser. A 118(7): 1939-1965 (2011)

Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: Obituary. Philippe Flajolet. J. Symb. Comput. 46(9): 1085-1086 (2011)

Yongwook Choi, Wojciech Szpankowski: Constrained pattern matching. ACM Transactions on Algorithms 7(2): 25 (2011)

Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: Philippe flajolet, the father of analytic combinatorics. ACM Transactions on Algorithms 7(4): 40 (2011)

Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée: Philippe Flajolet, the Father of Analytic Combinatorics. Theor. Comput. Sci. 412(35): 4469-4470 (2011)

Wojciech Szpankowski, Sergio Verdú: Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints. IEEE Transactions on Information Theory 57(7): 4017-4025 (2011)

Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Markov processes: The finite-memory switch case. ISIT 2011: 298-302

Michael Drmota, Wojciech Szpankowski: Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. ISIT 2011: 1317-1321

Philippe Jacquet, Wojciech Szpankowski: Limiting distribution of Lempel Ziv'78 redundancy. ISIT 2011: 1509-1513

Michael Drmota, Wojciech Szpankowski: A Master Theorem for Discrete Divide and Conquer Recurrences. SODA 2011: 342-361

Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood. CoRR abs/1108.5212 (2011)

Gopal Pandurangan, Wojciech Szpankowski: A Universal Online Caching Algorithm Based on Pattern Matching. Algorithmica 57(1): 62-73 (2010)

Olgica Milenkovic, Gil Alterovitz, Gerard Battail, Todd P. Coleman, Joachim Hagenauer, Sean P. Meyn, Nathan D. Price, Marco Ramoni, Ilya Shmulevich, Wojciech Szpankowski: Introduction to the special issue on information theory in molecular biology and neuroscience. IEEE Transactions on Information Theory 56(2): 649-652 (2010)

Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski: Tunstall code, Khodak variations, and random walks. IEEE Transactions on Information Theory 56(6): 2928-2937 (2010)

Philippe Jacquet, Wojciech Szpankowski: Noisy Constrained Capacity for BSC Channels. IEEE Transactions on Information Theory 56(11): 5412-5423 (2010)

Wojciech Szpankowski, Marcelo J. Weinberger: Minimax redundancy for large alphabets. ISIT 2010: 1488-1492

Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009)

GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski: Profiles of Tries. SIAM J. Comput. 38(5): 1821-1880 (2009)

Yongwook Choi, Wojciech Szpankowski: Compression of graphical structures. ISIT 2009: 364-368

Wojciech Szpankowski, Sergio Verdú: Minimum expected length of fixed-to-variable lossless compression of memoryless sources. ISIT 2009: 369-373

John C. Kieffer, En-Hui Yang, Wojciech Szpankowski: Structural complexity of random binary trees. ISIT 2009: 635-639

Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski: Deinterleaving Markov processes via penalized ML. ISIT 2009: 1739-1743

Michael Drmota, Wojciech Szpankowski: (Un)expected behavior of digital search tree profile. SODA 2009: 130-138

Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the entropy of a hidden Markov process. Theor. Comput. Sci. 395(2-3): 203-219 (2008)

Wojciech Szpankowski: A One-to-One Code and Its Anti-Redundancy. IEEE Transactions on Information Theory 54(10): 4762-4766 (2008)

Yann Bugeaud, Michael Drmota, Wojciech Szpankowski: On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Transactions on Information Theory 54(11): 5073-5086 (2008)

Yongwook Choi, Wojciech Szpankowski: Large deviations for constrained pattern matching. ISIT 2008: 2141-2145

GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski: Profile of Tries. LATIN 2008: 1-11

Jayesh Pandey, Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Annotating Pathways of Interaction Networks. Pacific Symposium on Biocomputing 2008: 153-165

Robert Sedgewick, Wojciech Szpankowski (Eds.): Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008

Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski: Randomized leader election. Distributed Computing 19(5-6): 403-418 (2007)

Valery T. Stefanov, Wojciech Szpankowski: Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)

Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski: Identifying Statistical Dependence in Genomic Sequences via Mutual Information Estimates. EURASIP J. Bioinformatics and Systems Biology 2007 (2007)

Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. Journal of Computational Biology 14(6): 747-764 (2007)

Svante Janson, Wojciech Szpankowski: Partial fillup and search time in LC tries. ACM Transactions on Algorithms 3(4) (2007)

Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward: Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments. IEEE Transactions on Information Theory 53(5): 1799-1813 (2007)

Jayesh Pandey, Mehmet Koyutürk, Yohan Kim, Wojciech Szpankowski, Shankar Subramaniam, Ananth Grama: Functional annotation of regulatory pathways. ISMB/ECCB (Supplement of Bioinformatics) 2007: 377-386

Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. SODA 2007: 891-899

Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski: Identifying statistical dependence in genomic sequences via mutual information estimates. CoRR abs/0710.5190 (2007)

Philippe Jacquet, Daniel Panario, Wojciech Szpankowski: Preface. Algorithmica 46(3-4): 247-248 (2006)

Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée: Hidden word statistics. J. ACM 53(1): 147-183 (2006)

Mehmet Koyutürk, Yohan Kim, Umut Topkara, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama: Pairwise Alignment of Protein Interaction Networks. Journal of Computational Biology 13(2): 182-199 (2006)

Mehmet Koyutürk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama: Detecting Conserved Interaction Patterns in Biological Networks. Journal of Computational Biology 13(7): 1299-1322 (2006)

Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang: Finding biclusters by random projections. Theor. Comput. Sci. 368(3): 217-230 (2006)

Cedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski: Multicast tree structure and the power law. IEEE Transactions on Information Theory 52(4): 1508-1521 (2006)

Charles Knessl, Wojciech Szpankowski: Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. ANALCO 2006: 198-204

Svante Janson, Wojciech Szpankowski: Partial Fillup and Search Time in LC Tries. ANALCO 2006: 223-229

Yonghui Wu, Stefano Lonardi, Wojciech Szpankowski: Error-Resilient LZW Data Compression. DCC 2006: 193-202

Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB 2006: 45-59

Charles Knessl, Wojciech Szpankowski: Enumeration of Binary Trees and Universal Types. Discrete Mathematics & Theoretical Computer Science 7(1): 313-400 (2005)

Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski: An optimal DNA segmentation based on the MDL principle. IJBRA 1(1): 3-17 (2005)

Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Reliable detection of episodes in event sequences. Knowl. Inf. Syst. 7(4): 415-437 (2005)

Luc Devroye, Wojciech Szpankowski: Probabilistic behavior of asymmetric level compressed tries. Random Struct. Algorithms 27(2): 185-200 (2005)

Charles Knessl, Wojciech Szpankowski: Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO 2005: 222-229

Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution. RECOMB 2005: 48-65

Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Markov Models for Identification of Significant Episodes. SDM 2005

GaHyun Park, Wojciech Szpankowski: Towards a complete characterization of tries. SODA 2005: 33-42

Svante Janson, Wojciech Szpankowski: Partial fillup and search time in LC tries. CoRR abs/cs/0510017 (2005)

Michael Drmota, Wojciech Szpankowski: Special Issue on Analysis of Algorithms. Combinatorics, Probability & Computing 13(4-5): 415-417 (2004)

Charles Knessl, Wojciech Szpankowski: On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004)

Svante Janson, Stefano Lonardi, Wojciech Szpankowski: On average sequence complexity. Theor. Comput. Sci. 326(1-3): 213-227 (2004)

John C. Kieffer, Wojciech Szpankowski, En-Hui Yang: Problems on Sequences: Information Theory and Computer Science Interface. IEEE Transactions on Information Theory 50(7): 1385-1392 (2004)

Philippe Jacquet, Wojciech Szpankowski: Markov types and minimax redundancy for Markov sources. IEEE Transactions on Information Theory 50(7): 1393-1402 (2004)

Michael Drmota, Wojciech Szpankowski: Precise minimax redundancy and regret. IEEE Transactions on Information Theory 50(11): 2686-2707 (2004)

Mark Daniel Ward, Wojciech Szpankowski: Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. ALENEX/ANALC 2004: 153-160

Svante Janson, Stefano Lonardi, Wojciech Szpankowski: On the Average Sequence Complexity. CPM 2004: 74-88

Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang: Finding Biclusters by Random Projections. CPM 2004: 102-116

Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB 2004: 480-484

Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the Entropy of a Hidden Markov Process. Data Compression Conference 2004: 362-371

Svante Janson, Stefano Lonardi, Wojciech Szpankowski: On the Average Sequence Complexity. Data Compression Conference 2004: 542

Mikhail J. Atallah, Robert Gwadera, Wojciech Szpankowski: Detection of Significant Sets of Episodes in Event Sequences. ICDM 2004: 3-10

Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB/ECCB (Supplement of Bioinformatics) 2004: 200-207

Michael Drmota, Wojciech Szpankowski: Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bulletin of the EATCS 80: 61-76 (2003)

Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski: An Optimal DNA Segmentation Based on the MDL Principle. CSB 2003: 541-546

Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003: 575-580

Stefano Lonardi, Wojciech Szpankowski: Joint Source-Channel LZ'77 Coding. DCC 2003: 273-282

Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Reliable Detection of Episodes in Event Sequences. ICDM 2003: 67-74

Charles Knessl, Wojciech Szpankowski: Limit laws for the height in PATRICIA tries. J. Algorithms 44(1): 63-97 (2002)

Charles Knessl, Wojciech Szpankowski: The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. 289(1): 649-703 (2002)

Marc Alzina, Wojciech Szpankowski, Ananth Grama: 2D-pattern matching image and video compression: theory, algorithms, and experiments. IEEE Transactions on Image Processing 11(3): 318-331 (2002)

Philippe Jacquet, Wojciech Szpankowski, Izydor Apostol: A universal predictor based on pattern matching. IEEE Transactions on Information Theory 48(6): 1462-1472 (2002)

Helmut Prodinger, Wojciech Szpankowski: Optimal versus randomized search of fixed length binary words. IEEE Transactions on Information Theory 48(9): 2614-2621 (2002)

Philippe Flajolet, Wojciech Szpankowski: Analytic variations on redundancy rates of renewal processes. IEEE Transactions on Information Theory 48(11): 2911-2921 (2002)

Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski: Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC 2002: 222-

Yuriy A. Reznik, Wojciech Szpankowski: Improved Behaviour of Tries by the "Symmetrization" of the Source. DCC 2002: 372-

Sacha Zyto, Ananth Grama, Wojciech Szpankowski: Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002: 484

Michael Drmota, Wojciech Szpankowski: Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN 2002: 306-318

Cedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski: Is the internet fractal? SODA 2002: 338-345

Helmut Prodinger, Wojciech Szpankowski: Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001)

Philippe Jacquet, Wojciech Szpankowski, Jing Tang: Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. Algorithmica 31(3): 318-360 (2001)

Yuriy A. Reznik, Wojciech Szpankowski: On the average redundancy rate of the Lempel-Ziv code with the k-error protocol. Inf. Sci. 135(1-2): 57-70 (2001)

Ananth Grama, David Meyer, Wojciech Szpankowski: Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001: 496

Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée: Hidden Pattern Statistics. ICALP 2001: 152-165

Charles Knessl, Wojciech Szpankowski: A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electr. J. Comb. 7 (2000)

Charles Knessl, Wojciech Szpankowski: Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. SIAM J. Comput. 30(3): 923-964 (2000)

Wojciech Szpankowski: Asymptotic average redundancy of Huffman (and other) block codes. IEEE Transactions on Information Theory 46(7): 2434-2443 (2000)

Yuriy A. Reznik, Wojciech Szpankowski: On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol. Data Compression Conference 2000: 373-382

Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski: Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference 2000: 420-429

Charles Knessl, Wojciech Szpankowski: Heights in Generalized Tries and PATRICIA Tries. LATIN 2000: 298-307

Charles Knessl, Wojciech Szpankowski: Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA 2000: 187-196

Charles Knessl, Wojciech Szpankowski: Quicksort Algorithm Again Revisited. Discrete Mathematics & Theoretical Computer Science 3(2): 43-64 (1999)

Izydor Apostol, Wojciech Szpankowski: Indexing and mapping of proteins using a modified nonlinear Sammon projection. Journal of Computational Chemistry 20(10): 1049-1059 (1999)

Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski: Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 614-627 (1999)

Guy Louchard, Wojciech Szpankowski, Jing Tang: Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm. SIAM J. Comput. 28(3): 904-934 (1999)

Philippe Jacquet, Wojciech Szpankowski: Entropy Computations via Analytic Depoissonization. IEEE Transactions on Information Theory 45(4): 1072-1081 (1999)

Marc Alzina, Wojciech Szpankowski, Ananth Grama: 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999: 424-433

Alan M. Frieze, Wojciech Szpankowski: Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica 21(1): 21-36 (1998)

Helmut Prodinger, Wojciech Szpankowski: Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica 22(4): 366-387 (1998)

Mireille Régnier, Wojciech Szpankowski: On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica 22(4): 631-649 (1998)

Philippe Jacquet, Wojciech Szpankowski: Analytical Depoissonization and its Applications. Theor. Comput. Sci. 201(1-2): 1-62 (1998)

Mireille Régnier, Wojciech Szpankowski: Complexity of Sequential Pattern Matching Algorithms. RANDOM 1998: 187-199

Charles Knessl, Wojciech Szpankowski: Quicksort Again Revisited. RANDOM 1998: 345-356

Svante Janson, Wojciech Szpankowski: Analysis of an Asymmetric Leader Election Algorithm. Electr. J. Comb. 4(1) (1997)

Philippe Flajolet, Wojciech Szpankowski: Analysis of algorithms. Random Struct. Algorithms 10(1-2): 1-3 (1997)

Guy Louchard, Wojciech Szpankowski: On the average redundancy rate of the Lempel-Ziv code. IEEE Transactions on Information Theory 43(1): 2-8 (1997)

Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas: Stability analysis of quota allocation access protocols in ring networks with spatial reuse. IEEE Transactions on Information Theory 43(3): 923-937 (1997)

Tomasz Luczak, Wojciech Szpankowski: A suboptimal lossy data compression based on approximate pattern matching. IEEE Transactions on Information Theory 43(5): 1439-1451 (1997)

Tomasz Luczak, Wojciech Szpankowski: Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. IEEE Transactions on Information Theory 43(6): 2064-2065 (1997)

Ioannis Fudos, Evaggelia Pitoura, Wojciech Szpankowski: On Pattern Occurrences in a Random Text. Inf. Process. Lett. 57(6): 307-312 (1996)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Analysis of a splitting process arising in probabilistic counting and other related algorithms. Random Struct. Algorithms 9(4): 379-401 (1996)

Guy Louchard, Wojciech Szpankowski: On the Average Redundancy Rate of the Lempel-Ziv Code. Data Compression Conference 1996: 92-101

Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski: Pattern Matching Image Compression. Data Compression Conference 1996: 421

Alan M. Frieze, Wojciech Szpankowski: Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA 1996: 194-207

Mikhail J. Atallah, Wojciech Szpankowski, Yann Génin: A pattern matching approach to image compression. ICIP (2) 1996: 349-352

Guy Louchard, Wojciech Szpankowski: A probabilistic Analysis of a String Editing Problem and its Variations. Combinatorics, Probability & Computing 4: 143-166 (1995)

Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas: A scheduling policy with maximal stability region for ring networks with spatial reuse. Queueing Syst. 19(1-2): 131-148 (1995)

Philippe Jacquet, Wojciech Szpankowski: Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theor. Comput. Sci. 144(1&2): 161-197 (1995)

Guy Louchard, Wojciech Szpankowski: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Transactions on Information Theory 41(2): 478-488 (1995)

Wojciech Szpankowski: On asymptotics of certain sums arising in coding theory. IEEE Transactions on Information Theory 41(6): 2087-2090 (1995)

Guy Louchard, Wojciech Szpankowski: Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile. Data Compression Conference 1995: 262-271

Philippe Jacquet, Wojciech Szpankowski: Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach. J. Comb. Theory, Ser. A 66(2): 237-269 (1994)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994)

Tomasz Luczak, Wojciech Szpankowski: A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. CPM 1994: 102-112

Philippe Jacquet, Wojciech Szpankowski: A functional equation often arising in the analysis of algorithms (extended abstract). STOC 1994: 780-789

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Multidimensional Digital Searching and Some New Parameters in Tries. Int. J. Found. Comput. Sci. 4(1): 69-84 (1993)

Helmut Prodinger, Wojciech Szpankowski: A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. 46(6): 309-311 (1993)

Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski: A Probabilistic Analysis of a Pattern Matching Problem. Random Struct. Algorithms 4(2): 191-214 (1993)

Wojciech Szpankowski: A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors. SIAM J. Comput. 22(6): 1176-1198 (1993)

Bonita Rais, Philippe Jacquet, Wojciech Szpankowski: Limiting Distribution for the Depth in Patricia Tries. SIAM J. Discrete Math. 6(2): 197-213 (1993)

Wojciech Szpankowski: Asymptotic properties of data compression and suffix trees. IEEE Transactions on Information Theory 39(5): 1647-1659 (1993)

Guy Louchard, Wojciech Szpankowski: Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993: 152-163

Alberto Apostolico, Wojciech Szpankowski: Self-Alignments in Words and Their Applications. J. Algorithms 13(3): 446-467 (1992)

Leonidas Georgiadis, Wojciech Szpankowski: Stability of token passing rings. Queueing Syst. 11(1-2): 7-33 (1992)

Luc Devroye, Wojciech Szpankowski, Bonita Rais: A Note on the Height of Suffix Trees. SIAM J. Comput. 21(1): 48-53 (1992)

David Aldous, Micha Hofri, Wojciech Szpankowski: Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. SIAM J. Comput. 21(4): 713-732 (1992)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. Theor. Comput. Sci. 106(2): 395-400 (1992)

Wojciech Szpankowski: Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract). CPM 1992: 1-14

Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski: Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM 1992: 27-40

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. ICALP 1992: 211-222

Wojciech Szpankowski: (Un)expected Behavior of Typical Suffix Trees. SODA 1992: 422-431

Wojciech Szpankowski: On the Height of Digital Trees and Related Problems. Algorithmica 6(2): 256-277 (1991)

Wojciech Szpankowski: A Characterization of Digital Search Trees from the Successful Search Viewpoint. Theor. Comput. Sci. 85(1): 117-134 (1991)

Philippe Jacquet, Wojciech Szpankowski: Analysis of digital tries with Markovian dependency. IEEE Transactions on Information Theory 37(5): 1470-1475 (1991)

Wojciech Szpankowski: A Typical Behaviour of Some Data Compression Schemes. Data Compression Conference 1991: 247-256

Wojciech Szpankowski: Combinatorial Optimization Through Order Statistics. ISA 1991: 208-217

Philippe Jacquet, Wojciech Szpankowski: What Can We Learn about Suffix Trees from Independent Tries? WADS 1991: 228-239

Wojciech Szpankowski: Patricia Tries Again Revisited. J. ACM 37(4): 691-711 (1990)

John S. Sadowsky, Wojciech Szpankowski: On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/G/c Queue. Performance 1990: 93-107

Wojciech Szpankowski: Some remarks on uniformly bounded markov chains: multimodality analysis. Computers & OR 16(2): 85-99 (1989)

Vernon Rego, Wojciech Szpankowski: The presence of exponentiality in entropy maximized M/GI/1 queues. Computers & OR 16(5): 441-449 (1989)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: On the variance of the external path length in a symmetric digital trie. Discrete Applied Mathematics 25(1-2): 129-143 (1989)

Philippe Jacquet, Wojciech Szpankowski: Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation. SIAM J. Comput. 18(4): 777-791 (1989)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: On the Balance Property of Patricia Tries: External Path Length Viewpoint. Theor. Comput. Sci. 68(1): 1-17 (1989)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Digital Search Trees - Further Results on a Fundamental Data Structure. IFIP Congress 1989: 443-447

Wojciech Szpankowski: Digital Data Structures and Order Statistics. WADS 1989: 206-217

Vernon Rego, Wojciech Szpankowski: Closed-network duals of multiqueues with application to token-passing systems. Comput. Syst. Sci. Eng. 3(3): 127-139 (1988)

Wojciech Szpankowski: The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures. Inf. Process. Lett. 28(1): 13-19 (1988)

Wojciech Szpankowski: Some Results on V-ary Asymmetric Tries. J. Algorithms 9(2): 224-244 (1988)

Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP 1988: 302-316

Wojciech Szpankowski: On an Alternative Sum Useful in the Analysis of Some Data Structures. SWAT 1988: 120-128

Wojciech Szpankowski: An Analysis of a Contention Resolution Algorithm: Another Approach. Acta Inf. 24(2): 173-190 (1987)

Wojciech Szpankowski: Two Problems on the Average Complexity of Digital Trees. Performance 1987: 189-208

Wojciech Szpankowski: Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). TAPSOFT, Vol.1 1987: 13-25

Wojciech Szpankowski: On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. Inf. Process. Lett. 23(3): 135-142 (1986)

Wojciech Szpankowski: Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System. Computer Networks 7: 17-26 (1983)

Wojciech Szpankowski: Performance Evaluation of a Reservation Protocol for Multiaccess Systems. Performance 1983: 377-394