| 2009 |
|---|
| 148 | EE | Michael Drmota,
Wojciech Szpankowski:
(Un)expected behavior of digital search tree profile.
SODA 2009: 130-138 |
| 147 | EE | Luc Devroye,
Gábor Lugosi,
GaHyun Park,
Wojciech Szpankowski:
Multiple choice tries and distributed hash tables.
Random Struct. Algorithms 34(3): 337-367 (2009) |
| 146 | EE | GaHyun Park,
Hsien-Kuei Hwang,
Pierre Nicodème,
Wojciech Szpankowski:
Profiles of Tries.
SIAM J. Comput. 38(5): 1821-1880 (2009) |
| 2008 |
|---|
| 145 | EE | GaHyun Park,
Hsien-Kuei Hwang,
Pierre Nicodème,
Wojciech Szpankowski:
Profile of Tries.
LATIN 2008: 1-11 |
| 144 | EE | Jayesh Pandey,
Mehmet Koyutürk,
Wojciech Szpankowski,
Ananth Grama:
Annotating Pathways of Interaction Networks.
Pacific Symposium on Biocomputing 2008: 153-165 |
| 143 | EE | Wojciech Szpankowski:
A One-to-One Code and Its Anti-Redundancy.
IEEE Transactions on Information Theory 54(10): 4762-4766 (2008) |
| 142 | EE | 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) |
| 141 | EE | Philippe Jacquet,
Gadiel Seroussi,
Wojciech Szpankowski:
On the entropy of a hidden Markov process.
Theor. Comput. Sci. 395(2-3): 203-219 (2008) |
| 2007 |
|---|
| 140 | EE | 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 |
| 139 | EE | Luc Devroye,
Gábor Lugosi,
GaHyun Park,
Wojciech Szpankowski:
Multiple choice tries and distributed hash tables.
SODA 2007: 891-899 |
| 138 | EE | Svante Janson,
Wojciech Szpankowski:
Partial fillup and search time in LC tries.
ACM Transactions on Algorithms 3(4): (2007) |
| 137 | EE | H. M. Aktulga,
I. Kontoyiannis,
L. A. Lyznik,
Lukasz Szpankowski,
A. Y. Grama,
Wojciech Szpankowski:
Identifying statistical dependence in genomic sequences via mutual information estimates
CoRR abs/0710.5190: (2007) |
| 136 | EE | Murali Krishna Ramanathan,
Ronaldo A. Ferreira,
Suresh Jagannathan,
Ananth Grama,
Wojciech Szpankowski:
Randomized leader election.
Distributed Computing 19(5-6): 403-418 (2007) |
| 135 | EE | 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) |
| 134 | EE | 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) |
| 2006 |
|---|
| 133 | EE | Yonghui Wu,
Stefano Lonardi,
Wojciech Szpankowski:
Error-Resilient LZW Data Compression.
DCC 2006: 193-202 |
| 132 | EE | Mehmet Koyutürk,
Ananth Grama,
Wojciech Szpankowski:
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks.
RECOMB 2006: 45-59 |
| 131 | EE | Philippe Jacquet,
Daniel Panario,
Wojciech Szpankowski:
Preface.
Algorithmica 46(3-4): 247-248 (2006) |
| 130 | EE | 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) |
| 129 | EE | Philippe Flajolet,
Wojciech Szpankowski,
Brigitte Vallée:
Hidden word statistics.
J. ACM 53(1): 147-183 (2006) |
| 128 | EE | 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) |
| 127 | EE | 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) |
| 126 | EE | Stefano Lonardi,
Wojciech Szpankowski,
Qiaofeng Yang:
Finding biclusters by random projections.
Theor. Comput. Sci. 368(3): 217-230 (2006) |
| 2005 |
|---|
| 125 | EE | Charles Knessl,
Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types.
ALENEX/ANALCO 2005: 222-229 |
| 124 | EE | Mehmet Koyutürk,
Ananth Grama,
Wojciech Szpankowski:
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution.
RECOMB 2005: 48-65 |
| 123 | | Robert Gwadera,
Mikhail J. Atallah,
Wojciech Szpankowski:
Markov Models for Identification of Significant Episodes.
SDM 2005 |
| 122 | EE | GaHyun Park,
Wojciech Szpankowski:
Towards a complete characterization of tries.
SODA 2005: 33-42 |
| 121 | EE | Svante Janson,
Wojciech Szpankowski:
Partial fillup and search time in LC tries
CoRR abs/cs/0510017: (2005) |
| 120 | EE | Charles Knessl,
Wojciech Szpankowski:
Enumeration of Binary Trees and Universal Types.
Discrete Mathematics & Theoretical Computer Science 7(1): 313-400 (2005) |
| 119 | EE | Wojciech Szpankowski,
Wenhui Ren,
Lukasz Szpankowski:
An optimal DNA segmentation based on the MDL principle.
IJBRA 1(1): 3-17 (2005) |
| 118 | EE | Robert Gwadera,
Mikhail J. Atallah,
Wojciech Szpankowski:
Reliable detection of episodes in event sequences.
Knowl. Inf. Syst. 7(4): 415-437 (2005) |
| 117 | EE | Luc Devroye,
Wojciech Szpankowski:
Probabilistic behavior of asymmetric level compressed tries.
Random Struct. Algorithms 27(2): 185-200 (2005) |
| 2004 |
|---|
| 116 | | Mark Daniel Ward,
Wojciech Szpankowski:
Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme.
ALENEX/ANALC 2004: 153-160 |
| 115 | EE | Stefano Lonardi,
Wojciech Szpankowski,
Qiaofeng Yang:
Finding Biclusters by Random Projections.
CPM 2004: 102-116 |
| 114 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On the Average Sequence Complexity.
CPM 2004: 74-88 |
| 113 | EE | Mehmet Koyutürk,
Wojciech Szpankowski,
Ananth Grama:
Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns.
CSB 2004: 480-484 |
| 112 | EE | Philippe Jacquet,
Gadiel Seroussi,
Wojciech Szpankowski:
On the Entropy of a Hidden Markov Process.
Data Compression Conference 2004: 362-371 |
| 111 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On the Average Sequence Complexity.
Data Compression Conference 2004: 542 |
| 110 | EE | Mikhail J. Atallah,
Robert Gwadera,
Wojciech Szpankowski:
Detection of Significant Sets of Episodes in Event Sequences.
ICDM 2004: 3-10 |
| 109 | EE | 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 |
| 108 | EE | Michael Drmota,
Wojciech Szpankowski:
Special Issue on Analysis of Algorithms.
Combinatorics, Probability & Computing 13(4-5): 415-417 (2004) |
| 107 | | Michael Drmota,
Wojciech Szpankowski:
Precise minimax redundancy and regret.
IEEE Transactions on Information Theory 50(11): 2686-2707 (2004) |
| 106 | | 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) |
| 105 | | Philippe Jacquet,
Wojciech Szpankowski:
Markov types and minimax redundancy for Markov sources.
IEEE Transactions on Information Theory 50(7): 1393-1402 (2004) |
| 104 | EE | Charles Knessl,
Wojciech Szpankowski:
On the number of full levels in tries.
Random Struct. Algorithms 25(3): 247-276 (2004) |
| 103 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On average sequence complexity.
Theor. Comput. Sci. 326(1-3): 213-227 (2004) |
| 2003 |
|---|
| 102 | EE | Wojciech Szpankowski,
Wenhui Ren,
Lukasz Szpankowski:
An Optimal DNA Segmentation Based on the MDL Principle.
CSB 2003: 541-546 |
| 101 | EE | Mehmet Koyutürk,
Ananth Grama,
Wojciech Szpankowski:
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments.
CSB 2003: 575-580 |
| 100 | EE | Stefano Lonardi,
Wojciech Szpankowski:
Joint Source-Channel LZ'77 Coding.
DCC 2003: 273-282 |
| 99 | EE | Robert Gwadera,
Mikhail J. Atallah,
Wojciech Szpankowski:
Reliable Detection of Episodes in Event Sequences.
ICDM 2003: 67-74 |
| 98 | | Michael Drmota,
Wojciech Szpankowski:
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk").
Bulletin of the EATCS 80: 61-76 (2003) |
| 2002 |
|---|
| 97 | EE | Michael Drmota,
Hsien-Kuei Hwang,
Wojciech Szpankowski:
Precise Average Redundancy Of An Idealized Arithmetic Codin.
DCC 2002: 222- |
| 96 | EE | Yuriy A. Reznik,
Wojciech Szpankowski:
Improved Behaviour of Tries by the "Symmetrization" of the Source.
DCC 2002: 372- |
| 95 | EE | Sacha Zyto,
Ananth Grama,
Wojciech Szpankowski:
Semi-discrete Matrix Transforms (SDD) for Image and Video Compression.
DCC 2002: 484 |
| 94 | EE | Michael Drmota,
Wojciech Szpankowski:
Generalized Shannon Code Minimizes the Maximal Redundancy.
LATIN 2002: 306-318 |
| 93 | EE | Cedric Adjih,
Leonidas Georgiadis,
Philippe Jacquet,
Wojciech Szpankowski:
Is the internet fractal?
SODA 2002: 338-345 |
| 92 | EE | 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) |
| 91 | | Philippe Flajolet,
Wojciech Szpankowski:
Analytic variations on redundancy rates of renewal processes.
IEEE Transactions on Information Theory 48(11): 2911-2921 (2002) |
| 90 | | Philippe Jacquet,
Wojciech Szpankowski,
Izydor Apostol:
A universal predictor based on pattern matching.
IEEE Transactions on Information Theory 48(6): 1462-1472 (2002) |
| 89 | | Helmut Prodinger,
Wojciech Szpankowski:
Optimal versus randomized search of fixed length binary words.
IEEE Transactions on Information Theory 48(9): 2614-2621 (2002) |
| 88 | EE | Charles Knessl,
Wojciech Szpankowski:
Limit laws for the height in PATRICIA tries.
J. Algorithms 44(1): 63-97 (2002) |
| 87 | | Charles Knessl,
Wojciech Szpankowski:
The height of a binary search tree: the limiting distribution perspective.
Theor. Comput. Sci. 289(1): 649-703 (2002) |
| 2001 |
|---|
| 86 | EE | Ananth Grama,
David Meyer,
Wojciech Szpankowski:
Real-Time Decompression of Streaming Video Using Mobile Code.
Data Compression Conference 2001: 496 |
| 85 | EE | Philippe Flajolet,
Yves Guivarc'h,
Wojciech Szpankowski,
Brigitte Vallée:
Hidden Pattern Statistics.
ICALP 2001: 152-165 |
| 84 | EE | Helmut Prodinger,
Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface.
Algorithmica 29(1): 1-2 (2001) |
| 83 | EE | Philippe Jacquet,
Wojciech Szpankowski,
Jing Tang:
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source.
Algorithmica 31(3): 318-360 (2001) |
| 82 | | 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) |
| 2000 |
|---|
| 81 | EE | 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 |
| 80 | EE | Dow-Yung Yang,
Akshay Johar,
Ananth Grama,
Wojciech Szpankowski:
Summary Structures for Frequency Queries on Large Transaction Sets.
Data Compression Conference 2000: 420-429 |
| 79 | | Charles Knessl,
Wojciech Szpankowski:
Heights in Generalized Tries and PATRICIA Tries.
LATIN 2000: 298-307 |
| 78 | EE | Charles Knessl,
Wojciech Szpankowski:
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme.
SODA 2000: 187-196 |
| 77 | EE | Charles Knessl,
Wojciech Szpankowski:
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large.
Electr. J. Comb. 7: (2000) |
| 76 | | Wojciech Szpankowski:
Asymptotic average redundancy of Huffman (and other) block codes.
IEEE Transactions on Information Theory 46(7): 2434-2443 (2000) |
| 75 | EE | 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) |
| 1999 |
|---|
| 74 | EE | Marc Alzina,
Wojciech Szpankowski,
Ananth Grama:
2D-Pattern Matching Image and Video Compression.
Data Compression Conference 1999: 424-433 |
| 73 | EE | Charles Knessl,
Wojciech Szpankowski:
Quicksort Algorithm Again Revisited.
Discrete Mathematics & Theoretical Computer Science 3(2): 43-64 (1999) |
| 72 | EE | 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) |
| 71 | | Philippe Jacquet,
Wojciech Szpankowski:
Entropy Computations via Analytic Depoissonization.
IEEE Transactions on Information Theory 45(4): 1072-1081 (1999) |
| 70 | EE | Izydor Apostol,
Wojciech Szpankowski:
Indexing and mapping of proteins using a modified nonlinear Sammon projection.
Journal of Computational Chemistry 20(10): 1049-1059 (1999) |
| 69 | | 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) |
| 1998 |
|---|
| 68 | EE | Mireille Régnier,
Wojciech Szpankowski:
Complexity of Sequential Pattern Matching Algorithms.
RANDOM 1998: 187-199 |
| 67 | EE | Charles Knessl,
Wojciech Szpankowski:
Quicksort Again Revisited.
RANDOM 1998: 345-356 |
| 66 | | Alan M. Frieze,
Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal.
Algorithmica 21(1): 21-36 (1998) |
| 65 | EE | Helmut Prodinger,
Wojciech Szpankowski:
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.
Algorithmica 22(4): 366-387 (1998) |
| 64 | EE | Mireille Régnier,
Wojciech Szpankowski:
On Pattern Frequency Occurrences in a Markovian Sequence.
Algorithmica 22(4): 631-649 (1998) |
| 63 | EE | Philippe Jacquet,
Wojciech Szpankowski:
Analytical Depoissonization and its Applications.
Theor. Comput. Sci. 201(1-2): 1-62 (1998) |
| 1997 |
|---|
| 62 | EE | Svante Janson,
Wojciech Szpankowski:
Analysis of an Asymmetric Leader Election Algorithm.
Electr. J. Comb. 4(1): (1997) |
| 61 | | Guy Louchard,
Wojciech Szpankowski:
On the average redundancy rate of the Lempel-Ziv code.
IEEE Transactions on Information Theory 43(1): 2-8 (1997) |
| 60 | | 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) |
| 59 | | Tomasz Luczak,
Wojciech Szpankowski:
A suboptimal lossy data compression based on approximate pattern matching.
IEEE Transactions on Information Theory 43(5): 1439-1451 (1997) |
| 58 | | 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) |
| 57 | | Philippe Flajolet,
Wojciech Szpankowski:
Analysis of algorithms.
Random Struct. Algorithms 10(1-2): 1-3 (1997) |
| 1996 |
|---|
| 56 | | Mikhail J. Atallah,
Yann Génin,
Wojciech Szpankowski:
Pattern Matching Image Compression.
Data Compression Conference 1996: 421 |
| 55 | | Guy Louchard,
Wojciech Szpankowski:
On the Average Redundancy Rate of the Lempel-Ziv Code.
Data Compression Conference 1996: 92-101 |
| 54 | | Alan M. Frieze,
Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal.
ESA 1996: 194-207 |
| 53 | EE | Ioannis Fudos,
Evaggelia Pitoura,
Wojciech Szpankowski:
On Pattern Occurrences in a Random Text.
Inf. Process. Lett. 57(6): 307-312 (1996) |
| 52 | | 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) |
| 1995 |
|---|
| 51 | | Guy Louchard,
Wojciech Szpankowski:
Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.
Data Compression Conference 1995: 262-271 |
| 50 | | 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) |
| 49 | | Wojciech Szpankowski:
On asymptotics of certain sums arising in coding theory.
IEEE Transactions on Information Theory 41(6): 2087-2090 (1995) |
| 48 | EE | 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) |
| 47 | EE | 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) |
| 1994 |
|---|
| 46 | | Tomasz Luczak,
Wojciech Szpankowski:
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.
CPM 1994: 102-112 |
| 45 | EE | Philippe Jacquet,
Wojciech Szpankowski:
A functional equation often arising in the analysis of algorithms (extended abstract).
STOC 1994: 780-789 |
| 44 | | 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) |
| 43 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput. 23(3): 598-616 (1994) |
| 1993 |
|---|
| 42 | | Guy Louchard,
Wojciech Szpankowski:
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).
CPM 1993: 152-163 |
| 41 | | Wojciech Szpankowski:
Asymptotic properties of data compression and suffix trees.
IEEE Transactions on Information Theory 39(5): 1647-1659 (1993) |
| 40 | | Helmut Prodinger,
Wojciech Szpankowski:
A Note on Binomial Recurrences Arising in the Analysis of Algorithms.
Inf. Process. Lett. 46(6): 309-311 (1993) |
| 39 | | 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) |
| 38 | | Mikhail J. Atallah,
Philippe Jacquet,
Wojciech Szpankowski:
A Probabilistic Analysis of a Pattern Matching Problem.
Random Struct. Algorithms 4(2): 191-214 (1993) |
| 37 | | Wojciech Szpankowski:
A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors.
SIAM J. Comput. 22(6): 1176-1198 (1993) |
| 36 | | Bonita Rais,
Philippe Jacquet,
Wojciech Szpankowski:
Limiting Distribution for the Depth in Patricia Tries.
SIAM J. Discrete Math. 6(2): 197-213 (1993) |
| 1992 |
|---|
| 35 | | Wojciech Szpankowski:
Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract).
CPM 1992: 1-14 |
| 34 | | Mikhail J. Atallah,
Philippe Jacquet,
Wojciech Szpankowski:
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).
CPM 1992: 27-40 |
| 33 | | 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 |
| 32 | EE | Wojciech Szpankowski:
(Un)expected Behavior of Typical Suffix Trees.
SODA 1992: 422-431 |
| 31 | | Alberto Apostolico,
Wojciech Szpankowski:
Self-Alignments in Words and Their Applications.
J. Algorithms 13(3): 446-467 (1992) |
| 30 | EE | Leonidas Georgiadis,
Wojciech Szpankowski:
Stability of token passing rings.
Queueing Syst. 11(1-2): 7-33 (1992) |
| 29 | | Luc Devroye,
Wojciech Szpankowski,
Bonita Rais:
A Note on the Height of Suffix Trees.
SIAM J. Comput. 21(1): 48-53 (1992) |
| 28 | | 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) |
| 27 | | 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) |
| 1991 |
|---|
| 26 | | Wojciech Szpankowski:
A Typical Behaviour of Some Data Compression Schemes.
Data Compression Conference 1991: 247-256 |
| 25 | | Wojciech Szpankowski:
Combinatorial Optimization Through Order Statistics.
ISA 1991: 208-217 |
| 24 | | Philippe Jacquet,
Wojciech Szpankowski:
What Can We Learn about Suffix Trees from Independent Tries?
WADS 1991: 228-239 |
| 23 | | Wojciech Szpankowski:
On the Height of Digital Trees and Related Problems.
Algorithmica 6(2): 256-277 (1991) |
| 22 | | Philippe Jacquet,
Wojciech Szpankowski:
Analysis of digital tries with Markovian dependency.
IEEE Transactions on Information Theory 37(5): 1470- (1991) |
| 21 | | Wojciech Szpankowski:
A Characterization of Digital Search Trees from the Successful Search Viewpoint.
Theor. Comput. Sci. 85(1): 117-134 (1991) |
| 1990 |
|---|
| 20 | | 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 |
| 19 | EE | Wojciech Szpankowski:
Patricia Tries Again Revisited
J. ACM 37(4): 691-711 (1990) |
| 1989 |
|---|
| 18 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress 1989: 443-447 |
| 17 | | Wojciech Szpankowski:
Digital Data Structures and Order Statistics.
WADS 1989: 206-217 |
| 16 | EE | Wojciech Szpankowski:
Some remarks on uniformly bounded markov chains: multimodality analysis.
Computers & OR 16(2): 85-99 (1989) |
| 15 | EE | Vernon Rego,
Wojciech Szpankowski:
The presence of exponentiality in entropy maximized M/GI/1 queues.
Computers & OR 16(5): 441-449 (1989) |
| 14 | EE | 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) |
| 13 | | 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) |
| 12 | | 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) |
| 1988 |
|---|
| 11 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
ICALP 1988: 302-316 |
| 10 | | Wojciech Szpankowski:
On an Alternative Sum Useful in the Analysis of Some Data Structures.
SWAT 1988: 120-128 |
| 9 | | Vernon Rego,
Wojciech Szpankowski:
Closed-network duals of multiqueues with application to token-passing systems.
Comput. Syst. Sci. Eng. 3(3): 127-139 (1988) |
| 8 | | 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) |
| 7 | | Wojciech Szpankowski:
Some Results on V-ary Asymmetric Tries.
J. Algorithms 9(2): 224-244 (1988) |
| 1987 |
|---|
| 6 | | Wojciech Szpankowski:
Two Problems on the Average Complexity of Digital Trees.
Performance 1987: 189-208 |
| 5 | | Wojciech Szpankowski:
Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract).
TAPSOFT, Vol.1 1987: 13-25 |
| 4 | | Wojciech Szpankowski:
An Analysis of a Contention Resolution Algorithm: Another Approach.
Acta Inf. 24(2): 173-190 (1987) |
| 1986 |
|---|
| 3 | | Wojciech Szpankowski:
On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications.
Inf. Process. Lett. 23(3): 135-142 (1986) |
| 1983 |
|---|
| 2 | | Wojciech Szpankowski:
Performance Evaluation of a Reservation Protocol for Multiaccess Systems.
Performance 1983: 377-394 |
| 1 | | Wojciech Szpankowski:
Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System.
Computer Networks 7: 17-26 (1983) |
