The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wojciech Szpankowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  131. Functional annotation of regulatory pathways. [Citation Graph (, )][DBLP]


  132. Profile of Tries. [Citation Graph (, )][DBLP]


  133. Annotating Pathways of Interaction Networks. [Citation Graph (, )][DBLP]


  134. (Un)expected behavior of digital search tree profile. [Citation Graph (, )][DBLP]


  135. A Universal Online Caching Algorithm Based on Pattern Matching. [Citation Graph (, )][DBLP]


  136. Partial fillup and search time in LC tries [Citation Graph (, )][DBLP]


  137. On the variance of the external path length in a symmetric digital trie. [Citation Graph (, )][DBLP]


  138. Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence. [Citation Graph (, )][DBLP]


Search in 0.103secs, Finished in 0.111secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002