dblp.uni-trier.dewww.uni-trier.de

Wojciech Szpankowski Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
149EEMichael Drmota, Wojciech Szpankowski: (Un)expected behavior of digital search tree profile. SODA 2009: 130-138
148EELuc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009)
147EEGaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski: Profiles of Tries. SIAM J. Comput. 38(5): 1821-1880 (2009)
2008
146EEGaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski: Profile of Tries. LATIN 2008: 1-11
145EEJayesh Pandey, Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Annotating Pathways of Interaction Networks. Pacific Symposium on Biocomputing 2008: 153-165
144EEWojciech Szpankowski: A One-to-One Code and Its Anti-Redundancy. IEEE Transactions on Information Theory 54(10): 4762-4766 (2008)
143EEYann 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)
142EEPhilippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the entropy of a hidden Markov process. Theor. Comput. Sci. 395(2-3): 203-219 (2008)
2007
141EEJayesh 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
140EELuc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. SODA 2007: 891-899
139EESvante Janson, Wojciech Szpankowski: Partial fillup and search time in LC tries. ACM Transactions on Algorithms 3(4): (2007)
138EEH. 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)
137EEValery T. Stefanov, Wojciech Szpankowski: Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence. Discrete Mathematics & Theoretical Computer Science 9(1): (2007)
136EEMurali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski: Randomized leader election. Distributed Computing 19(5-6): 403-418 (2007)
135EEStefano 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)
134EEMehmet 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
133EEYonghui Wu, Stefano Lonardi, Wojciech Szpankowski: Error-Resilient LZW Data Compression. DCC 2006: 193-202
132EEMehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB 2006: 45-59
131EEPhilippe Jacquet, Daniel Panario, Wojciech Szpankowski: Preface. Algorithmica 46(3-4): 247-248 (2006)
130EECedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski: Multicast tree structure and the power law. IEEE Transactions on Information Theory 52(4): 1508-1521 (2006)
129EEPhilippe Flajolet, Wojciech Szpankowski, Brigitte Vallée: Hidden word statistics. J. ACM 53(1): 147-183 (2006)
128EEMehmet 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)
127EEMehmet 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)
126EEStefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang: Finding biclusters by random projections. Theor. Comput. Sci. 368(3): 217-230 (2006)
2005
125EECharles Knessl, Wojciech Szpankowski: Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO 2005: 222-229
124EEMehmet 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
122EEGaHyun Park, Wojciech Szpankowski: Towards a complete characterization of tries. SODA 2005: 33-42
121EESvante Janson, Wojciech Szpankowski: Partial fillup and search time in LC tries CoRR abs/cs/0510017: (2005)
120EECharles Knessl, Wojciech Szpankowski: Enumeration of Binary Trees and Universal Types. Discrete Mathematics & Theoretical Computer Science 7(1): 313-400 (2005)
119EEWojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski: An optimal DNA segmentation based on the MDL principle. IJBRA 1(1): 3-17 (2005)
118EERobert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Reliable detection of episodes in event sequences. Knowl. Inf. Syst. 7(4): 415-437 (2005)
117EELuc 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
115EEStefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang: Finding Biclusters by Random Projections. CPM 2004: 102-116
114EESvante Janson, Stefano Lonardi, Wojciech Szpankowski: On the Average Sequence Complexity. CPM 2004: 74-88
113EEMehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB 2004: 480-484
112EEPhilippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the Entropy of a Hidden Markov Process. Data Compression Conference 2004: 362-371
111EESvante Janson, Stefano Lonardi, Wojciech Szpankowski: On the Average Sequence Complexity. Data Compression Conference 2004: 542
110EEMikhail J. Atallah, Robert Gwadera, Wojciech Szpankowski: Detection of Significant Sets of Episodes in Event Sequences. ICDM 2004: 3-10
109EEMehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB/ECCB (Supplement of Bioinformatics) 2004: 200-207
108EEMichael 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)
104EECharles Knessl, Wojciech Szpankowski: On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004)
103EESvante Janson, Stefano Lonardi, Wojciech Szpankowski: On average sequence complexity. Theor. Comput. Sci. 326(1-3): 213-227 (2004)
2003
102EEWojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski: An Optimal DNA Segmentation Based on the MDL Principle. CSB 2003: 541-546
101EEMehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003: 575-580
100EEStefano Lonardi, Wojciech Szpankowski: Joint Source-Channel LZ'77 Coding. DCC 2003: 273-282
99EERobert 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
97EEMichael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski: Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC 2002: 222-
96EEYuriy A. Reznik, Wojciech Szpankowski: Improved Behaviour of Tries by the "Symmetrization" of the Source. DCC 2002: 372-
95EESacha Zyto, Ananth Grama, Wojciech Szpankowski: Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002: 484
94EEMichael Drmota, Wojciech Szpankowski: Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN 2002: 306-318
93EECedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski: Is the internet fractal? SODA 2002: 338-345
92EEMarc 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)
88EECharles 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
86EEAnanth Grama, David Meyer, Wojciech Szpankowski: Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001: 496
85EEPhilippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée: Hidden Pattern Statistics. ICALP 2001: 152-165
84EEHelmut Prodinger, Wojciech Szpankowski: Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001)
83EEPhilippe 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
81EEYuriy A. Reznik, Wojciech Szpankowski: On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol. Data Compression Conference 2000: 373-382
80EEDow-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
78EECharles Knessl, Wojciech Szpankowski: Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA 2000: 187-196
77EECharles 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)
75EECharles 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
74EEMarc Alzina, Wojciech Szpankowski, Ananth Grama: 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999: 424-433
73EECharles Knessl, Wojciech Szpankowski: Quicksort Algorithm Again Revisited. Discrete Mathematics & Theoretical Computer Science 3(2): 43-64 (1999)
72EEMikhail 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)
70EEIzydor 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
68EEMireille Régnier, Wojciech Szpankowski: Complexity of Sequential Pattern Matching Algorithms. RANDOM 1998: 187-199
67EECharles 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)
65EEHelmut Prodinger, Wojciech Szpankowski: Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica 22(4): 366-387 (1998)
64EEMireille Régnier, Wojciech Szpankowski: On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica 22(4): 631-649 (1998)
63EEPhilippe Jacquet, Wojciech Szpankowski: Analytical Depoissonization and its Applications. Theor. Comput. Sci. 201(1-2): 1-62 (1998)
1997
62EESvante 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
54EEAlan M. Frieze, Wojciech Szpankowski: Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA 1996: 194-207
53EEIoannis 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)
48EELeonidas 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)
47EEPhilippe 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
45EEPhilippe 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
33EEPeter 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
32EEWojciech 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)
30EELeonidas 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
19EEWojciech 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
16EEWojciech Szpankowski: Some remarks on uniformly bounded markov chains: multimodality analysis. Computers & OR 16(2): 85-99 (1989)
15EEVernon Rego, Wojciech Szpankowski: The presence of exponentiality in entropy maximized M/GI/1 queues. Computers & OR 16(5): 441-449 (1989)
14EEPeter 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
11EEPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP 1988: 302-316
10EEWojciech 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
5EEWojciech 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)

Coauthor Index

1Cedric Adjih [93] [130]
2H. M. Aktulga [138]
3David Aldous [28]
4Marc Alzina [74] [92]
5Izydor Apostol [70] [90]
6Alberto Apostolico [31]
7Mikhail J. Atallah [34] [38] [56] [72] [99] [110] [118] [123]
8Yann Bugeaud [143]
9Luc Devroye [29] [117] [140] [148]
10Michael Drmota [94] [97] [98] [107] [108] [143] [149]
11Ronaldo A. Ferreira [136]
12Philippe Flajolet [57] [85] [91] [129]
13Alan M. Frieze [54] [66]
14Ioannis Fudos [53]
15Yann Génin [56] [72]
16Leonidas Georgiadis [30] [48] [60] [93] [130]
17A. Y. Grama [138]
18Ananth Grama [74] [80] [86] [92] [95] [101] [109] [113] [124] [127] [128] [132] [134] [136] [141] [145]
19Yves Guivarc'h [85]
20Robert Gwadera [99] [110] [118] [123]
21Micha Hofri [28]
22Hsien-Kuei Hwang [97] [146] [147]
23Philippe Jacquet [13] [22] [24] [34] [36] [38] [44] [45] [47] [63] [71] [83] [90] [93] [105] [112] [130] [131] [142]
24Suresh Jagannathan [136]
25Svante Janson [62] [103] [111] [114] [121] [139]
26Akshay Johar [80]
27John C. Kieffer [106]
28Yohan Kim [127] [128] [141]
29Peter Kirschenhofer [11] [12] [14] [18] [27] [33] [39] [43] [52]
30Charles Knessl [67] [73] [75] [77] [78] [79] [87] [88] [104] [120] [125]
31I. Kontoyiannis [138]
32Mehmet Koyutürk [101] [109] [113] [124] [127] [128] [132] [134] [141] [145]
33Stefano Lonardi [100] [103] [111] [114] [115] [126] [133] [135]
34Guy Louchard [42] [50] [51] [55] [61] [69]
35Tomasz Luczak [46] [58] [59]
36Gábor Lugosi [140] [148]
37L. A. Lyznik [138]
38David Meyer [86]
39Pierre Nicodème [146] [147]
40Daniel Panario [131]
41Jayesh Pandey [141] [145]
42GaHyun Park [122] [140] [146] [147] [148]
43Evaggelia Pitoura [53]
44Helmut Prodinger [11] [12] [14] [18] [27] [33] [39] [40] [43] [52] [65] [84] [89]
45Bonita Rais [29] [36]
46Murali Krishna Ramanathan [136]
47Mireille Régnier [64] [68]
48Vernon Rego [9] [15]
49Wenhui Ren [102] [119]
50Yuriy A. Reznik [81] [82] [96]
51John S. Sadowsky [20]
52Gadiel Seroussi [112] [142]
53Valery T. Stefanov [137]
54Shankar Subramaniam [127] [128] [141]
55Lukasz Szpankowski [102] [119] [138]
56Jing Tang [69] [83]
57Leandros Tassiulas [48] [60]
58Umut Topkara [128]
59Brigitte Vallée [85] [129]
60Mark Daniel Ward [116] [135]
61Yonghui Wu [133]
62Dow-Yung Yang [80]
63En-Hui Yang [106]
64Qiaofeng Yang [115] [126]
65Sacha Zyto [95]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)