☰

Wojciech Szpankowski - Publications

Affiliations: 
Purdue University, West Lafayette, IN, United States 
Area:
Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

114/222 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Sreedharan JK, Turowski K, Szpankowski W. Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries. Ieee/Acm Transactions On Computational Biology and Bioinformatics. PMID 32175871 DOI: 10.1109/Tcbb.2020.2980260  0.349
2020 Kontopoulou E, Dexter G, Szpankowski W, Grama A, Drineas P. Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices Ieee Transactions On Information Theory. 66: 5003-5021. DOI: 10.1109/Tit.2020.2971991  0.355
2020 Padakandla A, Kumar PR, Szpankowski W. The Trade-Off Between Privacy and Fidelity via Ehrhart Theory Ieee Transactions On Information Theory. 66: 2549-2569. DOI: 10.1109/Tit.2019.2959976  0.379
2020 Jacquet P, Milioris D, Szpankowski W. Joint string complexity for Markov sources: Small data matters Theoretical Computer Science. DOI: 10.1016/J.Tcs.2020.08.002  0.313
2019 Sreedharan JK, Magner A, Grama A, Szpankowski W. Inferring Temporal Information from a Snapshot of a Dynamic Network. Scientific Reports. 9: 3057. PMID 30816140 DOI: 10.1038/S41598-019-38912-0  0.317
2019 Gołębiewski Z, Magner A, Szpankowski W. Entropy and Optimal Compression of Some General Plane Trees Acm Transactions On Algorithms. 15: 1-23. DOI: 10.1145/3275444  0.418
2018 Magner A, Turowski K, Szpankowski W. Lossless Compression of Binary Trees with Correlated Vertex Names. Ieee Transactions On Information Theory. 64: 6070-6080. PMID 31537945 DOI: 10.1109/Tit.2018.2851224  0.39
2018 DRMOTA M, MAGNER A, SZPANKOWSKI W. Asymmetric Rényi Problem Combinatorics, Probability and Computing. 28: 542-573. DOI: 10.1017/S0963548318000329  0.346
2018 Buhmann JM, Dumazert J, Gronskiy A, Szpankowski W. Posterior agreement for large parameter-rich optimization problems Theoretical Computer Science. 745: 1-22. DOI: 10.1016/J.Tcs.2018.04.015  0.334
2016 Magner A, Duda J, Szpankowski W, Grama A. Fundamental Bounds for Sequence Reconstruction from Nanopore Sequencers. Ieee Transactions On Molecular, Biological, and Multi-Scale Communications. 2: 92-106. PMID 28868335 DOI: 10.1109/Tmbmc.2016.2630056  0.308
2016 Baryshnikov Y, Duda JJ, Szpankowski W. Types of markov fields and tilings Ieee Transactions On Information Theory. 62: 4361-4375. DOI: 10.1109/Tit.2016.2573834  0.338
2016 Magner A, Szpankowski W. Profiles of PATRICIA Tries Algorithmica. 80: 331-397. DOI: 10.1007/S00453-016-0261-5  0.352
2015 Szpankowski W. Frontiers of Science of Information Isis. DOI: 10.3390/Isis-Summit-Vienna-2015-I005  0.308
2014 Magner A, Janson S, Kollias G, Szpankowski W. On symmetry of uniform and preferential attachment graphs Electronic Journal of Combinatorics. 21. DOI: 10.37236/4415  0.341
2014 Jacquet P, Szpankowski W. On the limiting distribution of Lempel-Ziv'78 redundancy for memoryless sources Ieee Transactions On Information Theory. 60: 6917-6930. DOI: 10.1109/Tit.2014.2358679  0.448
2013 Merhav N, Szpankowski W. Average redundancy of the shannon code for markov sources Ieee Transactions On Information Theory. 59: 7186-7193. DOI: 10.1109/Tit.2013.2275920  0.318
2012 Choi Y, Knessl C, Szpankowski W. On a Recurrence Arising in Graph Compression Electronic Journal of Combinatorics. 19: 15. DOI: 10.37236/2540  0.38
2012 Szpankowski W, Weinberger MJ. Minimax pointwise redundancy for memoryless models over large alphabets Ieee Transactions On Information Theory. 58: 4094-4104. DOI: 10.1109/Tit.2012.2195769  0.382
2012 Jacquet P, Knessl C, Szpankowski W. Counting markov types, balanced matrices, and eulerian graphs Ieee Transactions On Information Theory. 58: 4261-4272. DOI: 10.1109/Tit.2012.2191476  0.31
2012 Choi Y, Szpankowski W. Compression of graphical structures: Fundamental limits, algorithms, and experiments Ieee Transactions On Information Theory. 58: 620-638. DOI: 10.1109/Tit.2011.2173710  0.412
2011 Drmota M, Szpankowski W. A master theorem for discrete divide and conquer recurrences Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 342-361. DOI: 10.1145/2487241.2487242  0.38
2011 Choi Y, Szpankowski W. Constrained pattern matching Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921671  0.329
2011 Szpankowski W, Verdú S. Minimum expected length of fixed-to-variable lossless compression without prefix constraints Ieee Transactions On Information Theory. 57: 4017-4025. DOI: 10.1109/Tit.2011.2145590  0.343
2011 Jacquet P, Szpankowski W. Limiting distribution of Lempel Ziv'78 redundancy Ieee International Symposium On Information Theory - Proceedings. 1509-1513. DOI: 10.1109/ISIT.2011.6033794  0.321
2011 Drmota M, Szpankowski W. Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences Ieee International Symposium On Information Theory - Proceedings. 1317-1321. DOI: 10.1109/ISIT.2011.6033751  0.301
2011 Drmota M, Szpankowski W. The expected profile of digital search trees Journal of Combinatorial Theory. Series A. 118: 1939-1965. DOI: 10.1016/J.Jcta.2011.04.001  0.394
2010 Jacquet P, Szpankowski W. Noisy constrained capacity for BSC channels Ieee Transactions On Information Theory. 56: 5412-5423. DOI: 10.1109/Tit.2010.2069170  0.319
2010 Drmota M, Reznik YA, Szpankowski W. Tunstall code, Khodak variations, and random walks Ieee Transactions On Information Theory. 56: 2928-2937. DOI: 10.1109/Tit.2010.2046248  0.338
2010 Pandurangan G, Szpankowski W. A universal online caching algorithm based on pattern matching Algorithmica (New York). 57: 62-73. DOI: 10.1007/S00453-008-9196-9  0.388
2009 Devroye L, Lugosi G, Park G, Szpankowski W. Multiple choice tries and distributed hash tables Random Structures and Algorithms. 34: 337-367. DOI: 10.1002/Rsa.V34:3  0.581
2009 Drmota M, Szpankowski W. (Un)expected behavior of digital search tree profile Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 130-138.  0.322
2008 Jacquet P, Seroussi G, Szpankowski W. On the entropy of a hidden Markov process. Theoretical Computer Science. 395: 203-219. PMID 19169438 DOI: 10.1016/J.Tcs.2008.01.012  0.32
2008 Park G, Hwang HK, Nicodème P, Szpankowski W. Profiles of tries Siam Journal On Computing. 38: 1821-1880. DOI: 10.1137/070685531  0.572
2008 Bugeaud Y, Drmota M, Szpankowski W. On the construction of (Explicit) Khodak's code and its analysis Ieee Transactions On Information Theory. 54: 5073-5086. DOI: 10.1109/Tit.2008.929959  0.351
2008 Szpankowski W. A one-to-one code and its anti-redundancy Ieee Transactions On Information Theory. 54: 4762-4766. DOI: 10.1109/Tit.2008.929009  0.336
2007 Aktulga HM, Kontoyiannis I, Lyznik LA, Szpankowski L, Grama AY, Szpankowski W. Identifying statistical dependence in genomic sequences via mutual information estimates. Eurasip Journal On Bioinformatics & Systems Biology. 14741. PMID 18301721 DOI: 10.1155/2007/14741  0.311
2007 Koyutürk M, Szpankowski W, Grama A. Assessing significance of connectivity and conservation in protein interaction networks. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 747-64. PMID 17691892 DOI: 10.1089/Cmb.2007.R014  0.644
2007 Lonardi S, Szpankowski W, Ward MD. Error resilient LZ'77 data compression: Algorithms, analysis, and experiments Ieee Transactions On Information Theory. 53: 1799-1813. DOI: 10.1109/Tit.2007.894689  0.385
2007 Ramanathan MK, Ferreira RA, Jagannathan S, Grama A, Szpankowski W. Randomized leader election Distributed Computing. 19: 403-418. DOI: 10.1007/S00446-007-0022-4  0.392
2006 Koyutürk M, Kim Y, Subramaniam S, Szpankowski W, Grama A. Detecting conserved interaction patterns in biological networks. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 13: 1299-322. PMID 17037960 DOI: 10.1089/Cmb.2006.13.1299  0.633
2006 Koyutürk M, Kim Y, Topkara U, Subramaniam S, Szpankowski W, Grama A. Pairwise alignment of protein interaction networks. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 13: 182-99. PMID 16597234 DOI: 10.1089/Cmb.2006.13.182  0.629
2006 Flajolet P, Szpankowski W, Vallée B. Hidden word statistics Journal of the Acm. 53: 147-183. DOI: 10.1145/1120582.1120586  0.402
2006 Adjih C, Georgiadis L, Jacquet P, Szpankowski W. Multicast tree structure and the power law Ieee Transactions On Information Theory. 52: 1508-1521. DOI: 10.1109/Tit.2006.871602  0.36
2005 Szpankowski W, Ren W, Szpankowski L. An optimal DNA segmentation based on the MDL principle. International Journal of Bioinformatics Research and Applications. 1: 3-17. PMID 18048118 DOI: 10.1504/Ijbra.2005.006899  0.319
2005 Park G, Szpankowski W. Towards a complete characterization of tries Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 33-42.  0.321
2005 Koyutürk M, Grama A, Szpankowski W. Pairwise local alignment of protein interaction networks guided by models of evolution Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science). 3500: 48-65.  0.602
2004 Koyutürk M, Grama A, Szpankowski W. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics (Oxford, England). 20: i200-7. PMID 15262800 DOI: 10.1093/bioinformatics/bth919  0.588
2004 Drmota M, Szpankowski W. Precise minimax redundancy and regret Ieee Transactions On Information Theory. 50: 2686-2707. DOI: 10.1109/Tit.2004.836702  0.348
2004 Jacquet P, Szpankowski W. Markov types and minimax redundancy for Markov sources Ieee Transactions On Information Theory. 50: 1393-1402. DOI: 10.1109/Tit.2004.830765  0.374
2004 DRMOTA M, SZPANKOWSKI W. Special Issue on Analysis of Algorithms Combinatorics, Probability and Computing. 13: 415-417. DOI: 10.1017/S0963548304006455  0.334
2004 Lonardi S, Szpankowski W, Yang Q. Finding biclusters by random projections Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3109: 102-116. DOI: 10.1016/J.Tcs.2006.09.023  0.348
2004 Janson S, Lonardi S, Szpankowski W. On average sequence complexity Theoretical Computer Science. 326: 213-227. DOI: 10.1016/J.Tcs.2004.06.023  0.336
2004 Knessl C, Szpankowski W. On the number of full levels in tries Random Structures and Algorithms. 25: 247-276. DOI: 10.1002/Rsa.20023  0.368
2003 Koyutürk M, Grama A, Szpankowski W. Algorithms for bounded-error correlation of high dimensional data in microarray experiments Proceedings of the 2003 Ieee Bioinformatics Conference, Csb 2003. 575-580. DOI: 10.1109/CSB.2003.1227412  0.588
2002 Alzina M, Szpankowski W, Grama A. 2D-pattern matching image and video compression: theory, algorithms, and experiments. Ieee Transactions On Image Processing : a Publication of the Ieee Signal Processing Society. 11: 318-31. PMID 18244634 DOI: 10.1109/83.988964  0.348
2002 Flajolet P, Szpankowski W. Analytic variations on redundancy rates of renewal processes Ieee Transactions On Information Theory. 48: 2911-2921. DOI: 10.1109/Tit.2002.804115  0.37
2002 Prodinger H, Szpankowski W. Optimal versus randomized search of fixed length binary words Ieee Transactions On Information Theory. 48: 2614-2621. DOI: 10.1109/Tit.2002.801478  0.355
2002 Jacquet P, Szpankowski W, Apostol I. A universal predictor based on pattern matching Ieee Transactions On Information Theory. 48: 1462-1472. DOI: 10.1109/Tit.2002.1003834  0.346
2002 Knessl C, Szpankowski W. The height of a binary search tree: The limiting distribution perspective Theoretical Computer Science. 289: 649-703. DOI: 10.1016/S0304-3975(01)00387-5  0.383
2002 Knessl C, Szpankowski W. Limit laws for the height in PATRICIA tries Journal of Algorithms. 44: 63-97. DOI: 10.1016/S0196-6774(02)00212-2  0.357
2001 Reznik YA, Szpankowski W. On the average redundancy rate of the Lempel-Ziv code with the k-error protocol Information Sciences. 135: 57-70. DOI: 10.1016/S0020-0255(01)00101-3  0.323
2001 Jacquet P, Szpankowski W, Tang J. Average profile of the Lempel-Ziv parsing scheme for a Markovian source Algorithmica (New York). 31: 318-360. DOI: 10.1007/S00453-001-0053-3  0.391
2000 Knessl C, Szpankowski W. A Note on the Asymptotic Behavior of the Heights in $b$-Tries for $b$ Large Electronic Journal of Combinatorics. 7: 39. DOI: 10.37236/1517  0.321
2000 Knessl C, Szpankowski W. Asymptotic behavior of the height in a digital search tree and the longest phrase of the Lempel-Ziv scheme Siam Journal On Computing. 30: 923-964. DOI: 10.1137/S0097539799356812  0.409
2000 Szpankowski W. Asymptotic average redundancy of Huffman (and other) block codes Ieee Transactions On Information Theory. 46: 2434-2443. DOI: 10.1109/18.887856  0.362
2000 Flajolet P, Szpankowski W. Analysis of algorithms Random Structures & Algorithms. 10: 1-3. DOI: 10.1002/(Sici)1098-2418(199701)10:1/2<1::Aid-Rsa1>3.0.Co;2-4  0.328
1999 Louchard GUY, Szpankowski W, Tang J. Average profile of the generalized digital search tree and the generalized Lempel-Ziv algorithm Siam Journal On Computing. 28: 904-934. DOI: 10.1137/S0097539796301811  0.395
1999 Atallah M, Genin Y, Szpankowski W. Pattern matching image compression: Algorithmic and empirical results Ieee Transactions On Pattern Analysis and Machine Intelligence. 21: 614-627. DOI: 10.1109/34.777372  0.317
1999 Jacquet P, Szpankowski W. Entropy computations via analytic depoissonization Ieee Transactions On Information Theory. 45: 1072-1081. DOI: 10.1109/18.761251  0.32
1998 Jacquet P, Szpankowski W. Analytical depoissonization and its applications Theoretical Computer Science. 201: 1-62. DOI: 10.1016/S0304-3975(97)00167-9  0.373
1998 Régnier M, Szpankowski W. On pattern frequency occurrences in a Markovian sequence Algorithmica (New York). 22: 631-649. DOI: 10.1007/Pl00009244  0.343
1998 Prodinger H, Szpankowski W. Philippe Flajolet's research in analysis of algorithms and combinatorics Algorithmica (New York). 22: 366-387. DOI: 10.1007/Pl00009230  0.39
1998 Frieze A, Szpankowski W. Greedy algorithms for the shortest common superstring that are asymptotically optimal Algorithmica (New York). 21: 21-36. DOI: 10.1007/Pl00009207  0.42
1997 Janson S, Szpankowski W. Analysis of an asymmetric leader election algorithm Electronic Journal of Combinatorics. 4: 1-16. DOI: 10.37236/1302  0.372
1997 Regnier M, Szpankowski W. On the approximate pattern occurrences in a text Sequence. 253-264. DOI: 10.1109/Sequen.1997.666920  0.337
1997 Łuczak T, Szpankowski W. A suboptimal lossy date compression based on approximate pattern matching Ieee Transactions On Information Theory. 43: 1439-1451. DOI: 10.1109/18.623143  0.3
1997 Louchard G, Szpankowski W. On the average redundancy rate of the Lempel-Ziv code Ieee Transactions On Information Theory. 43: 2-8. DOI: 10.1109/18.567640  0.44
1996 Fill JA, Mahmoud HM, Szpankowski W. On the distribution for the duration of a randomized leader election algorithm Annals of Applied Probability. 6: 1260-1283. DOI: 10.1214/Aoap/1035463332  0.37
1996 Fudos I, Pitoura E, Szpankowski W. On pattern occurrences in a random text Information Processing Letters. 57: 307-312. DOI: 10.1016/0020-0190(96)00022-1  0.317
1996 Kirschenhofer P, Prodinger H, Szpankowski W. Analysis of a splitting process arising in probabilistic counting and other related algorithms Random Structures and Algorithms. 9: 379-401. DOI: 10.1002/(Sici)1098-2418(199612)9:4<379::Aid-Rsa3>3.0.Co;2-U  0.396
1995 Sadowsky JS, Szpankowski W. The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits Advances in Applied Probability. 27: 532-566. DOI: 10.2307/1427838  0.318
1995 Szpankowski W. On Asymptotics of Certain Sums Arising in Coding Theory Ieee Transactions On Information Theory. 41: 2087-2090. DOI: 10.1109/18.476341  0.386
1995 Louchard G, Szpankowski W. Average Profile and Limiting Distribution for a Phrase Size in the Lempel—Ziv Parsing Algorithm Ieee Transactions On Information Theory. 41: 478-488. DOI: 10.1109/18.370149  0.413
1995 Szpankowski W. Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optimization. 33: 359-367. DOI: 10.1080/02331939508844086  0.352
1995 Louchard G, Szpankowski W. A Probabilistic Analysis of a String Editing Problem and its Variations Combinatorics, Probability and Computing. 4: 143-166. DOI: 10.1017/S0963548300001541  0.394
1995 Jacquet P, Szpankowski W. Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees Theoretical Computer Science. 144: 161-197. DOI: 10.1016/0304-3975(94)00298-W  0.432
1994 Kirschenhofer P, Prodinger H, Szpankowski W. Digital Search Trees Again Revisited: The Internal Path Length Perspective Siam Journal On Computing. 23: 598-616. DOI: 10.1137/S0097539790189368  0.425
1994 Jacquet P, Szpankowski W. Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach Journal of Combinatorial Theory, Series A. 66: 237-269. DOI: 10.1016/0097-3165(94)90065-5  0.415
1993 KIRSCHENHOFER P, PRODINGER H, SZPANKOWSKI W. MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES International Journal of Foundations of Computer Science. 4: 69-84. DOI: 10.1142/S0129054193000055  0.336
1993 Rais B, Jacquet P, Szpankowski W. Limiting Distribution for the Depth in PATRICIA Tries Siam Journal On Discrete Mathematics. 6: 197-213. DOI: 10.1137/0406016  0.412
1993 Szpankowski W. A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors Siam Journal On Computing. 22: 1176-1198. DOI: 10.1137/0222070  0.383
1993 Szpankowski W. Asymptotic Properties of Data Compression and Suffix Trees Ieee Transactions On Information Theory. 39: 1647-1659. DOI: 10.1109/18.259648  0.374
1993 Prodinger H, Szpankowski W. A note on binomial recurrences arising in the analysis of algorithms Information Processing Letters. 46: 309-311. DOI: 10.1016/0020-0190(93)90070-P  0.331
1993 Atallah MJ, Jacquet P, Szpankowski W. A probabilistic analysis of a pattern matching problem Random Structures and Algorithms. 4: 191-213. DOI: 10.1002/Rsa.3240040206  0.388
1992 Aldous D, Hofri M, Szpankowski W. Maximum size of a dynamic data structure: Hashing with lazy deletion revisited Siam Journal On Computing. 21: 713-732. DOI: 10.1137/0221043  0.347
1992 Devroye L, Szpankowski W, Rais B. A Note on the Height of Suffix Trees Siam Journal On Computing. 21: 48-53. DOI: 10.1137/0221005  0.345
1992 Sadowsky JS, Szpankowski W. Maximum Queue Length and Waiting Time Revisited: Multserver G/G/ c Queue Probability in the Engineering and Informational Sciences. 6: 157-170. DOI: 10.1017/S0269964800002424  0.337
1992 Kirschenhofer P, Prodinger H, Szpankowski W. Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter Theoretical Computer Science. 106: 395-400. DOI: 10.1016/0304-3975(92)90262-E  0.319
1992 Apostolico A, Szpankowski W. Self-alignments in words and their applications Journal of Algorithms. 13: 446-467. DOI: 10.1016/0196-6774(92)90049-I  0.394
1991 Jacquet P, Szpankowski W. Analysis of digital tries with Markovian dependency Ieee Transactions On Information Theory. 37: 1470-1475. DOI: 10.1109/18.133271  0.329
1991 Szpankowski W. A characterization of digital search trees from the successful search viewpoint Theoretical Computer Science. 85: 117-134. DOI: 10.1016/0304-3975(91)90050-C  0.372
1991 Szpankowski W. On the height of digital trees and related problems Algorithmica. 6: 256-277. DOI: 10.1007/Bf01759045  0.355
1991 Szpankowski W. Combinatorial Optimization Through Order Statistics Rundbrief Der Gi-Fachgruppe 5.10 Informationssystem-Architekturen. 208-217. DOI: 10.1007/3-540-54945-5_64  0.343
1990 Szpankowski W. Patricia Tries Again Revisited Journal of the Acm (Jacm). 37: 691-711. DOI: 10.1145/96559.214080  0.367
1990 Szpankowski W, Rego V. Yet another application of a binomial recurrence order statistics Computing. 43: 401-410. DOI: 10.1007/Bf02241658  0.324
1989 Jacquet P, Szpankowski W. Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation Siam Journal On Computing. 18: 777-791. DOI: 10.1137/0218054  0.36
1989 Szpankowski W. Some remarks on uniformly bounded markov chains: multimodality analysis Computers and Operations Research. 16: 85-99. DOI: 10.1016/0305-0548(89)90011-7  0.305
1989 Kirschenhofer P, Prodinger H, Szpankowski W. On the balance property of Patricia tries: External path length viewpoint Theoretical Computer Science. 68: 1-17. DOI: 10.1016/0304-3975(89)90115-1  0.426
1989 Kirschenhofer P, Prodinger H, Szpankowski W. On the variance of the external path length in a symmetric digital trie Discrete Applied Mathematics. 25: 129-143. DOI: 10.1016/0166-218X(89)90050-4  0.356
1988 Szpankowski W. Some results on V-ary asymmetric tries Journal of Algorithms. 9: 224-244. DOI: 10.1016/0196-6774(88)90039-9  0.345
1987 Szpankowski W. Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms Siam Journal On Algebraic Discrete Methods. 8: 233-250. DOI: 10.1137/0608021  0.367
1987 Szpankowski W. On a recurrence equation arising in the analysis of conflict resolution algorithms Communications in Statistics. Stochastic Models. 3: 89-114. DOI: 10.1080/15326348708807048  0.332
1987 Szpankowski W. An analysis of a contention resolution algorithm - Another approach Acta Informatica. 24: 173-190. DOI: 10.1007/Bf00264363  0.363
1986 Szpankowski W. On an asymptotic analysis of a tree-type algorithm for broadcast communications Information Processing Letters. 23: 135-142. DOI: 10.1016/0020-0190(86)90113-4  0.322
Low-probability matches (unlikely to be authored by this person)
2015 Magner A, Szpankowski W, Kihara D. On the origin of protein superfamilies and superfolds. Scientific Reports. 5: 8166. PMID 25703447 DOI: 10.1038/Srep08166  0.299
2004 Ward MD, Szpankowski W. Analysis of a randomized selection algorithm motivated by the LZ'77 scheme Proceedings of the Sixth Workshop On Algorithm Engineering and Experiments and the First Workshop On Analytic Algorithms and Combinatorics. 153-160.  0.299
2011 Salvy B, Sedgewick B, Soria M, Szpankowski W, Vallée B. PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011 Combinatorics, Probability and Computing. 20: 647-649. DOI: 10.1017/S0963548311000320  0.298
2014 Jacquet P, Knessl C, Szpankowski W. A note on a problem posed by D. E. knuth on a satisfiability recurrence Combinatorics Probability and Computing. 23: 829-841. DOI: 10.1017/S0963548314000133  0.293
2013 Leckey K, Neininger R, Szpankowski W. Towards more realistic probabilistic models for data structures: The external path length in tries under the Markov model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 877-886.  0.292
2001 Flajolet P, Guivarch Y, Szpankowski W, Vallée B. Hidden pattern statistics Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2076: 152-165.  0.292
2011 Seroussi G, Szpankowski W, Weinberger MJ. Deinterleaving finite memory processes via penalized maximum likelihood Hp Laboratories Technical Report. DOI: 10.1109/Tit.2012.2211333  0.289
2020 Turowski K, Magner A, Szpankowski W. Compression of Dynamic Graphs Generated by a Duplication Model Algorithmica. 82: 2687-2707. DOI: 10.1007/S00453-020-00699-2  0.287
2006 Janson S, Szpankowski W. Partial fillup and search time in LC tries Proceedings of the 8th Workshop On Algorithm Engineering and Experiments and the 3rd Workshop On Analytic Algorithms and Combinatorics. 2006: 223-229. DOI: 10.1145/1290672.1290681  0.287
1989 Rego V, Szpankowski W. The presence of exponentiality in entropy maximized M/GI/1 queues Computers and Operations Research. 16: 441-449. DOI: 10.1016/0305-0548(89)90032-4  0.279
2006 Knessl C, Szpankowski W. On the joint path length distribution in random binary trees Studies in Applied Mathematics. 117: 109-147. DOI: 10.1111/J.1467-9590.2006.00349.X  0.278
2005 Szpankowski W. Analytic algorithmics, combinatorics, and information theory Proceedings of the Ieee Itsoc Information Theory Workshop 2005 On Coding and Complexity, Itw2005. 216. DOI: 10.1109/ITW.2005.1531891  0.275
2019 Łuczak T, Magner A, Szpankowski W. Asymmetry and structural information in preferential attachment graphs Random Structures & Algorithms. 55: 696-718. DOI: 10.1002/Rsa.20842  0.275
2005 Knessl C, Szpankowski W. Enumeration of binary trees, Lempel-Ziv'78 parsings, and universal types Proceedings of the Seventh Workshop On Algorithm Engineering and Experiments and the Second Workshop On Analytic Algorithms and Combinatorics. 222-229.  0.271
2008 Park G, Hwang HK, Nicodème P, Szpankowski W. Profile of tries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 1-11. DOI: 10.1007/978-3-540-78773-0_1  0.269
2002 Reznik YA, Szpankowski W. Improved behaviour of tries by the "symmetrization" of the source Data Compression Conference Proceedings. 2002: 372-381. DOI: 10.1109/DCC.2002.999975  0.268
1995 Georgiadis L, Szpankowski W, Tassiulas L. A scheduling policy with maximal stability region for ring networks with spatial reuse Queueing Systems. 19: 131-148. DOI: 10.1007/Bf01148943  0.268
2006 Knessl C, Szpankowski W. Binary trees, left and right paths, WKB expansions, and painlevé transcendents Proceedings of the 8th Workshop On Algorithm Engineering and Experiments and the 3rd Workshop On Analytic Algorithms and Combinatorics. 2006: 198-204.  0.268
2005 Knessl C, Szpankowski W. Enumeration of binary trees and universal types Discrete Mathematics and Theoretical Computer Science. 7: 313-400.  0.268
2004 Kieffer JC, Szpankowski W, Yang EH. Editorial: Problems on sequences: Information theory and computer science interface Ieee Transactions On Information Theory. 50: 1385-1392. DOI: 10.1109/Tit.2004.830747  0.266
2020 Apostol I, Wu R, Ko M, Song JL, Li L, Schlobohm G, Szpankowski W. Prediction of precision for purity methods. Journal of Pharmaceutical Sciences. PMID 31978383 DOI: 10.1016/J.Xphs.2020.01.013  0.265
2010 Szpankowski W, Weinberger MJ. Minimax redundancy for large alphabets Ieee International Symposium On Information Theory - Proceedings. 1488-1492. DOI: 10.1109/ISIT.2010.5513572  0.264
2012 Choi Y, Knessl C, Szpankowski W. On a recurrence arising in graph compression Electronic Journal of Combinatorics. 19.  0.263
2009 Bina M, Wyss P, Lazarus SA, Shah SR, Ren W, Szpankowski W, Crawford GE, Park SP, Song XC. Discovering sequences with potential regulatory characteristics. Genomics. 93: 314-22. PMID 19084590 DOI: 10.1016/J.Ygeno.2008.11.008  0.261
2002 Adjih C, Georgiadis L, Jacquet P, Szpankowski W. Is the internet fractal? Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 338-345.  0.26
2012 Apostol I, Kelner D, Jiang XG, Huang G, Wypych J, Zhang X, Gastwirt J, Chen K, Fodor S, Hapuarachchi S, Meriage D, Ye F, Poppe L, Szpankowski W. Uncertainty estimates of purity measurements based on current information: toward a "live validation" of purity methods. Pharmaceutical Research. 29: 3404-19. PMID 22893253 DOI: 10.1007/S11095-012-0836-Z  0.258
1996 Fill JA, Mahmoud HM, Szpankowski W. On the distribution for the duration of a randomized leader election algorithm Annals of Applied Probability. 6: 1260-1283.  0.253
1992 Georgiadis L, Szpankowski W. Stability of token passing rings Queueing Systems. 11: 7-33. DOI: 10.1007/Bf01159285  0.253
1988 Szpankowski W. The evaluation of an alternative sum with applications to the analysis of some data structures Information Processing Letters. 28: 13-19. DOI: 10.1016/0020-0190(88)90137-8  0.252
2008 Knessl C, Szpankowski W. On some non-linear recurrences that arise in computer science Frontiers of Applied and Computational Mathematics: New Jersey Institute of Technology, Usa, 19 - 21 May 2008. 172-181. DOI: 10.1142/9789812835291_0018  0.251
2005 Gwadera R, Atallah M, Szpankowski W. Markov models for identification of significant episodes Proceedings of the 2005 Siam International Conference On Data Mining, Sdm 2005. 404-414.  0.248
2014 Magner A, Knessl C, Szpankowski W. Expected external profile of PATRICIA tries 11th Workshop On Analytic Algorithmics and Combinatorics 2014, Analco 2014. 16-24.  0.247
2006 Drmota M, Reznik Y, Savari SA, Szpankowski W. Precise asymptotic analysis of the tunstall code Ieee International Symposium On Information Theory - Proceedings. 2334-2337. DOI: 10.1109/ISIT.2006.261984  0.246
1999 Apostol I, Szpankowski W. Indexing and mapping of proteins using a modified nonlinear Sammon projection Journal of Computational Chemistry. 20: 1049-1059. DOI: 10.1002/(Sici)1096-987X(19990730)20:10<1049::Aid-Jcc7>3.0.Co;2-X  0.245
2018 Szpankowski W, Grama A. Frontiers of Science of Information: Shannon Meets Turing Computer. 51: 28-38. DOI: 10.1109/Mc.2018.1151004  0.244
2004 Bina M, Wyss P, Ren W, Szpankowski W, Thomas E, Randhawa R, Reddy S, John PM, Pares-Matos EI, Stein A, Xu H, Lazarus SA. Exploring the characteristics of sequence elements in proximal promoters of human genes. Genomics. 84: 929-40. PMID 15533710 DOI: 10.1016/J.Ygeno.2004.08.013  0.243
2000 Knessl C, Szpankowski W. Heights in generalized tries and PATRICIA tries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1776: 298-307. DOI: 10.1007/10719839_31  0.234
2009 Kieffer JC, Yang EH, Szpankowski W. Structural complexity of random binary trees Ieee International Symposium On Information Theory - Proceedings. 635-639. DOI: 10.1109/ISIT.2009.5205704  0.234
2020 Kontopoulou EM, Dexter GP, Szpankowski W, Grama A, Drineas P. Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. Ieee Transactions On Information Theory. 66: 5003-5021. PMID 33746243 DOI: 10.1109/tit.2020.2971991  0.233
2015 Jacquet P, Szpankowski W. Analytic pattern matching: From DNA to twitter Analytic Pattern Matching: From Dna to Twitter. 1-366. DOI: 10.1017/CBO9780511843204  0.231
2011 Salvy B, Sedgewick B, Soria M, Szpankowski W, Vallée B. Obituary: Philippe Flajolet, the Father of Analytic Combinatorics Theoretical Computer Science. 412: 4469-4470. DOI: 10.1016/J.Tcs.2011.05.048  0.229
2011 Salvy B, Sedgewick B, Soria M, Szpankowski W, Vallee B. Philippe flajolet, the father of analytic combinatorics Acm Transactions On Algorithms. 7. DOI: 10.1145/2016567.2016575  0.229
2011 Salvy B, Sedgewick R, Soria M, Szpankowski W, Vallée B. In memoriam: Philippe Flajolet, the father of analytic combinatorics Rairo - Theoretical Informatics and Applications. 45: 371-373. DOI: 10.1051/Ita/2011110  0.229
2002 Drmota M, Hwang HK, Szpankowski W. Precise average redundancy of an idealized arithmetic coding Data Compression Conference Proceedings. 2002: 222-231. DOI: 10.1109/DCC.2002.999960  0.228
2007 Pandey J, Koyutürk M, Kim Y, Szpankowski W, Subramaniam S, Grama A. Functional annotation of regulatory pathways. Bioinformatics (Oxford, England). 23: i377-86. PMID 17646320 DOI: 10.1093/bioinformatics/btm203  0.222
2010 Milenkovic O, Alterovitz G, Battail G, Coleman TP, Hagenauer J, Meyn SP, Price N, Ramoni MF, Shmulevich I, Szpankowski W. Introduction to the special issue on information theory in molecular biology and neuroscience Ieee Transactions On Information Theory. 56: 649-652. DOI: 10.1109/Tit.2009.2036971  0.219
2008 Choi Y, Szpankowski W. Large deviations for constrained pattern matching Ieee International Symposium On Information Theory - Proceedings. 2141-2145. DOI: 10.1109/ISIT.2008.4595368  0.218
2002 Prodinger H, Szpankowski W. Optimal versus randomized search of fixed length words Ieee International Symposium On Information Theory - Proceedings. 205.  0.212
2003 Jacquet P, Szpankowski W. Precise minimax redundancy for Markov sources Ieee International Symposium On Information Theory - Proceedings. 78.  0.21
1988 Szpankowski W, Rego V. Some Theorems on Instability with Applications to Multiaccess Protocols Operations Research. 36: 958-966. DOI: 10.1287/Opre.36.6.958  0.21
2009 Szpankowski W, Verdú S. Minimum expected length of fixed-to-variable lossless compression of memoryless sources Ieee International Symposium On Information Theory - Proceedings. 369-373. DOI: 10.1109/ISIT.2009.5205737  0.204
1998 Szpankowski W. On the asymptotics of the minimax redundancy arising in a universal coding Ieee International Symposium On Information Theory - Proceedings. 349. DOI: 10.1109/ISIT.1998.708954  0.2
2002 Drmota M, Szpankowski W. Generalized Shannon code minimizes the maximal redundancy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2286: 306-318.  0.198
1997 Georgiadis L, Szpankowski W, Tassiulas L. Stability analysis of quota allocation access protocols in ring networks with spatial reuse Ieee Transactions On Information Theory. 43: 923-937. DOI: 10.1109/18.568702  0.197
2007 Choi Y, Szpankowski W. Pattern matching in constrained sequences Ieee International Symposium On Information Theory - Proceedings. 2606-2610. DOI: 10.1109/ISIT.2007.4557611  0.197
1983 Szpankowski W. Packet switching in multiple radio channels Computer Compacts. 1: 51. DOI: 10.1016/0167-7136(83)90144-0  0.195
2009 Seroussi G, Szpankowski W, Weinberger MJ. Deinterleaving markov processes via penalized ML Ieee International Symposium On Information Theory - Proceedings. 1739-1743. DOI: 10.1109/ISIT.2009.5205257  0.195
2000 Knessl C, Szpankowski W. A note on the asymptotic behavior of the heights in b-tries for b large Electronic Journal of Combinatorics. 7: 1-16.  0.192
1998 Jacquet P, Szpankowski W. Entropy computations for discrete distributions: Towards analytic information theory Ieee International Symposium On Information Theory - Proceedings. 373. DOI: 10.1109/ISIT.1998.708978  0.189
2005 Gwadera R, Atallah MJ, Szpankowski W. Reliable detection of episodes in event sequences Knowledge and Information Systems. 7: 415-437. DOI: 10.1007/s10115-004-0174-5  0.189
2011 Salvy B, Sedgewick B, Soria M, Szpankowski W, Vallee B. Obituary. Philippe Flajolet Journal of Symbolic Computation. 46: 1085-1086. DOI: 10.1016/J.Jsc.2011.06.003  0.188
2000 Flajolet P, Szpankowski W. Analytic variations on the redundancy rate of renewal processes Ieee International Symposium On Information Theory - Proceedings. 499.  0.187
1999 Knessl C, Szpankowski W. Quicksort algorithm again revisited Discrete Mathematics and Theoretical Computer Science. 3: 43-64.  0.187
1998 Régnier M, Szpankowski W. Complexity of sequential pattern matching algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1518: 187-199. DOI: 10.1007/3-540-49543-6_16  0.186
2008 Pandey J, Koyutürk M, Szpankowski W, Grama A. Annotating pathways in interaction networks. Pacific Symposium On Biocomputing. Pacific Symposium On Biocomputing. 153-65. PMID 18229683  0.183
2007 Aktulga HM, Kontoyiannis I, Lyznik LA, Szpankowski L, Grama AY, Szpankowski W. Statistical dependence in biological sequences Ieee International Symposium On Information Theory - Proceedings. 2676-2680. DOI: 10.1109/ISIT.2007.4557183  0.183
2000 Szpankowski W. Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes Ieee International Symposium On Information Theory - Proceedings. 370.  0.182
2006 Jacquet P, Szpankowski W. On (d, k) sequences not containing a given word Ieee International Symposium On Information Theory - Proceedings. 1486-1489. DOI: 10.1109/ISIT.2006.262115  0.178
2003 Lonardi S, Szpankowski W. Joint source-channel LZ'77 coding Data Compression Conference Proceedings. 2003: 273-282. DOI: 10.1109/DCC.2003.1194018  0.178
2003 Reznik YA, Szpankowski W. Asymptotic average redundancy of adaptive block codes Ieee International Symposium On Information Theory - Proceedings. 79.  0.168
2012 Cichoń J, Lemiesz J, Szpankowski W, Zawada M. Two-phase cardinality estimation protocols for sensor networks with provable precision Ieee Wireless Communications and Networking Conference, Wcnc. 2009-2013. DOI: 10.1109/WCNC.2012.6214120  0.168
1983 Szpankowski W. Analysis and Stability Considerations in a Reservation Multiaccess System Ieee Transactions On Communications. 31: 684-692. DOI: 10.1109/TCOM.1983.1095866  0.165
2017 Magner A, Kihara D, Szpankowski W. A Study of the Boltzmann Sequence-Structure Channel. Proceedings of the Ieee. Institute of Electrical and Electronics Engineers. 105: 286-305. PMID 28943650 DOI: 10.1109/JPROC.2016.2608797  0.162
2013 Truong LV, Szpankowski W. Capacity of a structural binary symmetric channel Ieee International Symposium On Information Theory - Proceedings. 2478-2482. DOI: 10.1109/ISIT.2013.6620672  0.16
2008 Sedgewick R, Szpankowski W. Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics: Analco workshop preface Proceedings of the 10th Workshop On Algorithm Engineering and Experiments and the 5th Workshop On Analytic Algorithmics and Combinatorics. ix.  0.155
2013 Jacquet P, Milioris D, Szpankowski W. Classification of Markov sources through joint string complexity: Theory and experiments Ieee International Symposium On Information Theory - Proceedings. 2289-2293. DOI: 10.1109/ISIT.2013.6620634  0.154
2005 Devroye L, Szpankowski W. Probabilistic behavior of asymmetric Level Compressed tries Random Structures and Algorithms. 27: 185-200. DOI: 10.1002/Rsa.V27:2  0.147
1994 Szpankowski W. Stability conditions for some distributed systems: buffered random access systems Advances in Applied Probability. 26: 498-515. DOI: 10.1017/S0001867800026318  0.142
2011 Seroussi G, Szpankowski W, Weinberger MJ. Deinterleaving Markov processes: The finite-memory switch case Ieee International Symposium On Information Theory - Proceedings. 298-302. DOI: 10.1109/ISIT.2011.6034127  0.139
1997 Luczak T, Szpankowski W. Correction to "A Suboptimal Lossy Date Compression Based On Approximate Pattern Matching" Ieee Transactions On Information Theory. 43: 2064-2064. DOI: 10.1109/TIT.1997.641579  0.139
2006 Wu Y, Lonardi S, Szpankowski W. Error-resilient LZW data compression Data Compression Conference Proceedings. 193-202. DOI: 10.1109/DCC.2006.33  0.136
2002 Jacquet P, Szpankowski W, Aposto I. A universal pattern matching predictor for mixing sources Ieee International Symposium On Information Theory - Proceedings. 150.  0.135
2002 Savari SA, Szpankowski W. On the analysis of variable-to-variable length codes Ieee International Symposium On Information Theory - Proceedings. 176.  0.133
1986 Szpankowski W. Bounds for Queue Lengths in a Contention Packet Broadcast System Ieee Transactions On Communications. 34: 1132-1140. DOI: 10.1109/TCOM.1986.1096465  0.129
2017 Drmota M, Szpankowski W. Redundancy of Lossless Data Compression for Known Sources by Analytic Methods Foundations and Trends® in Communications and Information Theory. 13: 277-417. DOI: 10.1561/0100000090  0.129
2015 Magner A, Kihara D, Szpankowski W. Phase transitions in a sequence-structure channel 2015 Information Theory and Applications Workshop, Ita 2015 - Conference Proceedings. 235-239. DOI: 10.1109/ITA.2015.7308994  0.128
2004 Drmota M, Szpankowski W. Variable-to-variable codes with small redundancy rates Ieee International Symposium On Information Theory - Proceedings. 91.  0.123
2004 Lonardi S, Szpankowski W, Ward MD. Error resilient LZ'77 scheme and its analysis Ieee International Symposium On Information Theory - Proceedings. 56.  0.117
1985 Szpankowski W. Some sufficient conditions for non-ergodicity of markov chains Journal of Applied Probability. 22: 138-147. DOI: 10.2307/3213753  0.117
2001 Grama A, Meyer D, Szpankowski W. Real-time decompression of streaming video using mobile code Data Compression Conference Proceedings. 496.  0.117
2014 Santhanam N, Anantharam V, Kavcic A, Szpankowski W. Data-driven weak universal redundancy Ieee International Symposium On Information Theory - Proceedings. 1877-1881. DOI: 10.1109/ISIT.2014.6875159  0.095
2004 Atallah M, Gwadera R, Szpankowski W. Detection of significant sets of episodes in event sequences Proceedings - Fourth Ieee International Conference On Data Mining, Icdm 2004. 3-10. DOI: 10.1109/ICDM.2004.10090  0.093
2002 Drmota M, Szpankowski W. The precise minimax redundancy Ieee International Symposium On Information Theory - Proceedings. 35.  0.09
2004 Janson S, Lonardi S, Szpankowski W. On the average sequence complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3109: 74-88.  0.089
1992 Aldous D, Hofri M, Szpankowski W. Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited Siam Journal On Computing. 21: 713-732. DOI: 10.1137/0221043  0.084
1983 Szpankowski W. Packet switching in multiple radio channels: Analysis and stability of a random access system Computer Networks (1976). 7: 17-26. DOI: 10.1016/0376-5075(83)90004-1  0.08
2005 Szpankowski W. One-to-one code and its anti-redundancy Ieee International Symposium On Information Theory - Proceedings. 2005: 1526-1528. DOI: 10.1109/ISIT.2005.1523599  0.078
2004 Koyutürk M, Szpankowski W, Grama A. Biclustering gene-feature matrices for statistically significant dense patterns Proceedings - 2004 Ieee Computational Systems Bioinformatics Conference, Csb 2004. 480-484.  0.076
1998 Knessl C, Szpankowski W. Quicksort again revisited Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1518: 346-356. DOI: 10.1007/3-540-49543-6_27  0.073
1995 Prodinger H, Szpankowski W. Preface Theoretical Computer Science. 144: 1. DOI: 10.1007/BF02679610  0.065
2009 Choi Y, Szpankowski W. Compression of graphical structures Ieee International Symposium On Information Theory - Proceedings. 364-368. DOI: 10.1109/ISIT.2009.5205736  0.063
1988 Szpankowski W. Stability Conditions for Multidimensional Queueing Systems with Computer Applications Operations Research. 36: 944-957. DOI: 10.1287/opre.36.6.944  0.045
2012 Drmota M, Szpankowski W, Viswanathan K. Mutual information for a deletion channel Ieee International Symposium On Information Theory - Proceedings. 2561-2565. DOI: 10.1109/ISIT.2012.6283980  0.044
2008 Konorski J, Szpankowski W. What is information? 2008 Ieee Information Theory Workshop, Itw. 269-270. DOI: 10.1109/ITW.2008.4578666  0.044
2014 Baryshnikov Y, Duda J, Szpankowski W. Markov field types and tilings Ieee International Symposium On Information Theory - Proceedings. 2639-2643. DOI: 10.1109/ISIT.2014.6875312  0.029
2001 Prodinger H, Szpankowski W. Algorithmica (New York): Preface Algorithmica (New York). 29: 1-2. DOI: 10.1007/s00453-006-0139-z  0.027
2007 Panario D, Sedgewick B, Fill J, Frieze A, Hitczenko P, Hwang HK, Martinez C, Mitzenmacher M, Munro I, Neininger R, Schaeffer G, Sedgewick R, Flajolet P, Szpankowski W. Analco workshop preface Proceedings of the 9th Workshop On Algorithm Engineering and Experiments and the 4th Workshop On Analytic Algorithms and Combinatorics.  0.013
2006 Fill J, Golin M, Jacquet P, Kenyan C, McDiarmid C, Panario D, Sedgewick R, Viola A, Ward M, Flajolet P, Szpankowski W. Analco workshop preface Proceedings of the 8th Workshop On Algorithm Engineering and Experiments and the 3rd Workshop On Analytic Algorithms and Combinatorics. 2006.  0.013
Hide low-probability matches.