| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Wojciech Szpankowski 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 Michael Drmota , Wojciech Szpankowski: Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bulletin of the EATCS 80 : 61-76 (2003) 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 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) 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 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) 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: 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) Marc Alzina , Wojciech Szpankowski, Ananth Grama : 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999 : 424-433 Charles Knessl , Wojciech Szpankowski: Quicksort Algorithm Again Revisited. Discrete Mathematics & Theoretical Computer Science 3 (2): 43-64 (1999) Mikhail J. Atallah , Yann Génin , Wojciech Szpankowski: Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Transactions on Pattern Analysis and Machine Intelligence 21 (7): 614-627 (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) 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) 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 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) Guy Louchard , Wojciech Szpankowski: On the average redundancy rate of the Lempel-Ziv code. IEEE Transactions on Information Theory 43 (1): 2-8 (1997) Philippe Flajolet , Wojciech Szpankowski: Analysis of algorithms. Random Structures and Algorithms 10 (1-2): 1-3 (1997) Mikhail J. Atallah , Yann Génin , Wojciech Szpankowski: Pattern Matching Image Compression. Data Compression Conference 1996 : 421 Guy Louchard , Wojciech Szpankowski: On the Average Redundancy Rate of the Lempel-Ziv Code. Data Compression Conference 1996 : 92-101 Alan M. Frieze , Wojciech Szpankowski: Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA 1996 : 194-207 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 Structures and Algorithms 9 (4): 379-401 (1996) 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: Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theor. Comput. Sci. 144 (1&2): 161-197 (1995) 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: Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23 (3): 598-616 (1994) Guy Louchard , Wojciech Szpankowski: Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993 : 152-163 Helmut Prodinger , Wojciech Szpankowski: A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. 46 (6): 309-311 (1993) 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) Mikhail J. Atallah , Philippe Jacquet , Wojciech Szpankowski: A Probabilistic Analysis of a Pattern Matching Problem. Random Structures and 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: Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract). CPM 1992 : 1-14 Mikhail J. Atallah , Philippe Pacquet , 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 Alberto Apostolico , Wojciech Szpankowski: Self-Alignments in Words and Their Applications. J. Algorithms 13 (3): 446-467 (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: 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: 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) 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: Patricia Tries Again Revisited J. ACM 37 (4): 691-711 (1990) 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 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: 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 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) 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: An Analysis of a Contention Resolution Algorithm: Another Approach. Acta Inf. 24 (2): 173-190 (1987) Wojciech Szpankowski: On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. Inf. Process. Lett. 23 (3): 135-142 (1986) Wojciech Szpankowski: Performance Evaluation of a Reservation Protocol for Multiaccess Systems. Performance 1983 : 377-394 Wojciech Szpankowski: Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System. Computer Networks 7 : 17-26 (1983) 1 [ 72 ] 2 [ 24 ] 3 [ 59 ] 4 [ 56 ] 5 [ 26 ] 6 [ 29 ] [ 33 ] [ 46 ] [ 57 ] [ 78 ] 7 [ 25 ] 8 [ 73 ] [ 76 ] [ 77 ] 9 [ 47 ] [ 68 ] 10 [ 44 ] [ 52 ] 11 [ 43 ] 12 [ 46 ] [ 57 ] 13 [ 72 ] 14 [ 59 ] [ 63 ] [ 69 ] [ 74 ] [ 80 ] 15 [ 68 ] 16 [ 78 ] 17 [ 24 ] 18 [ 76 ] 19 [ 13 ] [ 20 ] [ 31 ] [ 33 ] [ 38 ] [ 40 ] [ 49 ] [ 66 ] [ 72 ] 20 [ 63 ] 21 [ 11 ] [ 12 ] [ 15 ] [ 23 ] [ 28 ] [ 34 ] [ 37 ] [ 42 ] 22 [ 53 ] [ 58 ] [ 60 ] [ 61 ] [ 62 ] [ 70 ] [ 71 ] 23 [ 80 ] 24 [ 79 ] 25 [ 36 ] [ 41 ] [ 45 ] [ 48 ] [ 55 ] 26 [ 39 ] 27 [ 69 ] 28 [ 29 ] 29 [ 43 ] 30 [ 11 ] [ 12 ] [ 15 ] [ 23 ] [ 28 ] [ 34 ] [ 35 ] [ 37 ] [ 42 ] [ 51 ] [ 67 ] 31 [ 25 ] [ 31 ] 32 [ 50 ] [ 54 ] 33 [ 9 ] 34 [ 81 ] 35 [ 64 ] [ 65 ] [ 75 ] 36 [ 17 ] 37 [ 81 ] 38 [ 55 ] [ 66 ] 39 [ 68 ] 40 [ 63 ] 41 [ 74 ]  ©2004 Association for Computing Machinery |
