default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Szpankowski
Person information
- affiliation: Purdue University, West Lafayette, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j146]Alan M. Frieze
, Krzysztof Turowski, Wojciech Szpankowski:
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. 38(1): 988-1006 (2024)- [c137]Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski:
Online Distribution Learning with Local Privacy Constraints. AISTATS 2024: 460-468 - [c136]Changlong Wu, Jin Sima, Wojciech Szpankowski:
Oracle-Efficient Hybrid Online Learning with Unknown Distribution. COLT 2024: 4992-5018 - [c135]Gil I. Shamir, Wojciech Szpankowski:
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. ISIT 2024: 975-980 - [c134]Mohsen Heidari, Wojciech Szpankowski:
New Bounds on Quantum Sample Complexity of Measurement Classes. ISIT 2024: 1515-1520 - [c133]Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski:
Minimax Regret with Unbounded Weights. ISIT 2024: 2305-2310 - [i37]Changlong Wu, Jin Sima, Wojciech Szpankowski:
Oracle-Efficient Hybrid Online Learning with Unknown Distribution. CoRR abs/2401.15520 (2024) - [i36]Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski:
Online Distribution Learning with Local Private Constraints. CoRR abs/2402.00315 (2024) - [i35]Mohsen Heidari, Masih Mozakka, Wojciech Szpankowski:
Efficient Gradient Estimation of Variational Quantum Circuits with Lie Algebraic Symmetries. CoRR abs/2404.05108 (2024) - [i34]Mohsen Heidari, Wojciech Szpankowski:
New Bounds on Quantum Sample Complexity of Measurement Classes. CoRR abs/2408.12683 (2024) - [i33]Changlong Wu, Ananth Grama, Wojciech Szpankowski:
No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models. CoRR abs/2410.19217 (2024) - 2023
- [j145]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Regret Bounds for Log-Loss via Bayesian Algorithms. IEEE Trans. Inf. Theory 69(9): 5971-5989 (2023) - [j144]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Expected Worst Case Regret via Stochastic Sequential Covering. Trans. Mach. Learn. Res. 2023 (2023) - [c132]Mohsen Heidari, Wojciech Szpankowski:
Learning k-qubit Quantum Operators via Pauli Decomposition. AISTATS 2023: 490-504 - [c131]Mohsen Heidari, Wojciech Szpankowski:
Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression. AISTATS 2023: 2922-2938 - [c130]Changlong Wu, Ananth Grama, Wojciech Szpankowski:
Online Learning in Dynamically Changing Environments. COLT 2023: 325-358 - [c129]Changlong Wu, Yifan Wang, Ananth Grama, Wojciech Szpankowski:
Learning Functional Distributions with Private Labels. ICML 2023: 37728-37744 - [i32]Changlong Wu, Ananth Grama, Wojciech Szpankowski:
Online Learning in Dynamically Changing Environments. CoRR abs/2302.00103 (2023) - [i31]Mohsen Heidari, Wojciech Szpankowski:
Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression. CoRR abs/2303.04859 (2023) - [i30]Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the concentration of the maximum degree in the duplication-divergence models. CoRR abs/2308.04336 (2023) - [i29]Changlong Wu, Ananth Grama, Wojciech Szpankowski:
Robust Online Classification: From Estimation to Denoising. CoRR abs/2309.01698 (2023) - [i28]Mohsen Heidari, Mobasshir A Naved, Wenbo Xie, Arjun Jacob Grama, Wojciech Szpankowski:
Quantum Shadow Gradient Descent for Quantum Learning. CoRR abs/2310.06935 (2023) - 2022
- [j143]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential universal modeling for non-binary sequences with constrained distributions. Commun. Inf. Syst. 22(1): 1-38 (2022) - [j142]Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski:
Compression and symmetry of small-world graphs and structures. Commun. Inf. Syst. 22(2): 275-302 (2022) - [j141]Narayana Santhanam, Venkatachalam Anantharam, Wojciech Szpankowski:
Data-Derived Weak Universal Consistency. J. Mach. Learn. Res. 23: 27:1-27:55 (2022) - [j140]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization. IEEE Trans. Inf. Theory 68(9): 6063-6077 (2022) - [c128]Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Toward Physically Realizable Quantum Neural Networks. AAAI 2022: 6902-6909 - [c127]Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. AISTATS 2022: 11615-11640 - [c126]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Sequential vs. Fixed Design Regrets in Online Learning. ISIT 2022: 438-443 - [c125]Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression. ISIT 2022: 444-449 - [c124]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. NeurIPS 2022 - [i27]Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Toward Physically Realizable Quantum Neural Networks. CoRR abs/2203.12092 (2022) - [i26]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. CoRR abs/2205.03728 (2022) - [i25]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Expected Worst Case Regret via Stochastic Sequential Covering. CoRR abs/2209.04417 (2022) - 2021
- [j139]Krzysztof Turowski, Wojciech Szpankowski:
Towards Degree Distribution of a Duplication-Divergence Graph Model. Electron. J. Comb. 28(1): 1 (2021) - [j138]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. Electron. J. Comb. 28(2): 2 (2021) - [j137]Jithin K. Sreedharan, Krzysztof Turowski, Wojciech Szpankowski:
Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries. IEEE ACM Trans. Comput. Biol. Bioinform. 18(3): 836-849 (2021) - [j136]Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski:
Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-Supervised Learning Algorithms. IEEE Trans. Netw. Sci. Eng. 8(2): 1426-1442 (2021) - [c123]Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression with Categorical Feature Values. ALT 2021: 755-771 - [c122]Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON 2021: 413-424 - [c121]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Finding Relevant Information via a Discrete Fourier Expansion. ICML 2021: 4181-4191 - [c120]Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
On maximum-likelihood estimation in the all-or-nothing regime. ISIT 2021: 1106-1111 - [c119]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. ISIT 2021: 1469-1474 - [c118]Gil I. Shamir, Wojciech Szpankowski:
A Lower Bound for Regret in Logistic Regression. ISIT 2021: 2507-2512 - [c117]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Information Sufficiency via Fourier Expansion. ISIT 2021: 2774-2779 - [c116]Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski:
Symmetry and the Entropy of Small-World Structures and Graphs. ISIT 2021: 3026-3031 - [i24]Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
On maximum-likelihood estimation in the all-or-nothing regime. CoRR abs/2101.09994 (2021) - [i23]Gil I. Shamir, Wojciech Szpankowski:
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. CoRR abs/2101.12113 (2021) - [i22]Mohsen Heidari, Wojciech Szpankowski:
A Low Degree Learning Algorithm for Quantum Data via Quantum Fourier. CoRR abs/2102.05209 (2021) - [i21]Mohsen Heidari, Wojciech Szpankowski:
On Agnostic PAC Learning using L2-polynomial Regression and Fourier-based Algorithms. CoRR abs/2102.06277 (2021) - [i20]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. CoRR abs/2107.06406 (2021) - 2020
- [j135]Krzysztof Turowski, Abram Magner, Wojciech Szpankowski:
Compression of Dynamic Graphs Generated by a Duplication Model. Algorithmica 82(9): 2687-2707 (2020) - [j134]Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski:
Joint string complexity for Markov sources: Small data matters. Theor. Comput. Sci. 844: 46-80 (2020) - [j133]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
The Trade-Off Between Privacy and Fidelity via Ehrhart Theory. IEEE Trans. Inf. Theory 66(4): 2549-2569 (2020) - [j132]Eugenia-Maria Kontopoulou, Gregory-Paul Dexter, Wojciech Szpankowski, Ananth Grama, Petros Drineas:
Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices. IEEE Trans. Inf. Theory 66(8): 5003-5021 (2020) - [c115]Abram Magner, Wojciech Szpankowski:
Toward universal testing of dynamic network models. ALT 2020: 615-633 - [c114]Philippe Jacquet, Wojciech Szpankowski:
Analysis of Lempel-Ziv'78 for Markov Sources. AofA 2020: 15:1-15:19 - [c113]Philippe Jacquet, Krzysztof Turowski, Wojciech Szpankowski:
Power-Law Degree Distribution in the Connected Component of a Duplication Graph. AofA 2020: 16:1-16:14 - [c112]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. AofA 2020: 17:1-17:15 - [c111]Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski:
Temporal Ordered Clustering in Dynamic Networks. ISIT 2020: 1349-1354 - [c110]Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG 2020: 226-237 - [i19]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. CoRR abs/2003.09584 (2020) - [i18]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions. CoRR abs/2005.10320 (2020) - [i17]Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski:
Compression and Symmetry of Small-World Graphs and Structures. CoRR abs/2007.15981 (2020) - [i16]Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. CoRR abs/2011.11500 (2020)
2010 – 2019
- 2019
- [j131]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem. Comb. Probab. Comput. 28(4): 542-573 (2019) - [j130]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Asymmetry and structural information in preferential attachment graphs. Random Struct. Algorithms 55(3): 696-718 (2019) - [j129]Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy and Optimal Compression of Some General Plane Trees. ACM Trans. Algorithms 15(1): 3:1-3:23 (2019) - [c109]Krzysztof Turowski, Philippe Jacquet, Wojciech Szpankowski:
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution. ISIT 2019: 1517-1521 - [c108]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Compression of Preferential Attachment Graphs. ISIT 2019: 1697-1701 - [i15]Abram Magner, Wojciech Szpankowski:
Goodness of Fit Testing for Dynamic Networks. CoRR abs/1904.03348 (2019) - [i14]Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski:
Temporal Ordered Clustering in Dynamic Networks. CoRR abs/1905.00672 (2019) - 2018
- [j128]Abram Magner, Wojciech Szpankowski:
Profiles of PATRICIA Tries. Algorithmica 80(1): 331-397 (2018) - [j127]Wojciech Szpankowski, Ananth Grama:
Frontiers of Science of Information: Shannon Meets Turing. Computer 51(1): 28-38 (2018) - [j126]Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy, Wojciech Szpankowski:
Posterior agreement for large parameter-rich optimization problems. Theor. Comput. Sci. 745: 1-22 (2018) - [j125]Abram Magner, Krzysztof Turowski, Wojciech Szpankowski:
Lossless Compression of Binary Trees With Correlated Vertex Names. IEEE Trans. Inf. Theory 64(9): 6070-6080 (2018) - [c107]Krzysztof Turowski, Abram Magner, Wojciech Szpankowski:
Compression of Dynamic Graphs Generated by a Duplication Model. Allerton 2018: 1089-1096 - [c106]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
Preserving Privacy and Fidelity via Ehrhart Theory. ISIT 2018: 696-700 - [c105]Alexey Gronskiy, Joachim M. Buhmann, Wojciech Szpankowski:
Free Energy Asymptotics for Problems with Weak Solution Dependencies. ISIT 2018: 2132-2136 - [c104]Eugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas:
Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. ISIT 2018: 2486-2490 - [c103]Abram N. Magner, Jithin K. Sreedharan, Ananth Y. Grama, Wojciech Szpankowski:
TIMES: Temporal Information Maximally Extracted from Structures. WWW 2018: 389-398 - [i13]Eugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas:
Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. CoRR abs/1801.01072 (2018) - [i12]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
The Trade-off between Privacy and Fidelity via Ehrhart Theory. CoRR abs/1803.03611 (2018) - [i11]Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski:
Joint String Complexity for Markov Sources: Small Data Matters. CoRR abs/1805.09025 (2018) - 2017
- [j124]Michael Drmota, Wojciech Szpankowski:
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. Found. Trends Commun. Inf. Theory 13(4): 277-417 (2017) - [j123]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
A Study of the Boltzmann Sequence-Structure Channel. Proc. IEEE 105(2): 286-305 (2017) - [c102]Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy, Wojciech Szpankowski:
Phase Transitions in Parameter Rich Optimization Problems. ANALCO 2017: 148-155 - [c101]Jacek Cichon, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski:
On Symmetries of Non-Plane Trees in a Non-Uniform Model. ANALCO 2017: 156-163 - [c100]Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy of some general plane trees. ISIT 2017: 301-305 - [c99]Abram Magner, Ananth Grama, Jithin K. Sreedharan, Wojciech Szpankowski:
Recovery of vertex orderings in dynamic graphs. ISIT 2017: 1563-1567 - 2016
- [j122]Yuliy M. Baryshnikov, Jaroslaw Jarek Duda, Wojciech Szpankowski:
Types of Markov Fields and Tilings. IEEE Trans. Inf. Theory 62(8): 4361-4375 (2016) - [j121]Abram Magner, Jaroslaw Duda, Wojciech Szpankowski, Ananth Grama:
Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 92-106 (2016) - [c98]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
The Boltzmann sequence-structure channel. ISIT 2016: 255-259 - [c97]Abram Magner, Krzysztof Turowski, Wojciech Szpankowski:
Lossless compression of binary trees with correlated vertex names. ISIT 2016: 1217-1221 - [i10]Jarek Duda, Wojciech Szpankowski, Ananth Grama:
Fundamental Bounds and Approaches to Sequence Reconstruction from Nanopore Sequencers. CoRR abs/1601.02420 (2016) - [i9]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem and PATRICIA Tries. CoRR abs/1605.01814 (2016) - [i8]Philippe Jacquet, Wojciech Szpankowski:
Average Size of a Suffix Tree for Markov Sources. CoRR abs/1605.02123 (2016) - 2015
- [b1]Philippe Jacquet, Wojciech Szpankowski:
Analytic Pattern Matching - From DNA to Twitter. Cambridge University Press 2015, ISBN 978-0-521-87608-7, pp. I-XXII, 1-366 - [c96]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
Phase transitions in a sequence-structure channel. ITA 2015: 235-239 - [i7]Kevin Leckey, Ralph Neininger, Wojciech Szpankowski:
A Limit Theorem for Radix Sort and Tries with Markovian Input. CoRR abs/1505.07321 (2015) - 2014
- [j120]Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski:
On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. 21(3): 3 (2014) - [j119]Philippe Jacquet, Charles Knessl, Wojciech Szpankowski:
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. Comb. Probab. Comput. 23(5): 829-841 (2014) - [j118]Philippe Jacquet, Wojciech Szpankowski:
On the Limiting Distribution of Lempel-Ziv'78 Redundancy for Memoryless Sources. IEEE Trans. Inf. Theory 60(11): 6917-6930 (2014) - [c95]Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. ANALCO 2014: 16-24 - [c94]Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data-driven weak universal redundancy. ISIT 2014: 1877-1881 - [c93]Yuliy M. Baryshnikov, Jaroslaw Duda, Wojciech Szpankowski:
Markov field types and tilings. ISIT 2014: 2639-2643 - [i6]Narayana P. Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data driven consistency (working title). CoRR abs/1411.4407 (2014) - 2013
- [j117]Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. J. ACM 60(3): 16:1-16:49 (2013) - [j116]Neri Merhav, Wojciech Szpankowski:
Average Redundancy of the Shannon Code for Markov Sources. IEEE Trans. Inf. Theory 59(11): 7186-7193 (2013) - [c92]Neri Merhav, Wojciech Szpankowski:
Average redundancy of the Shannon code for Markov sources. ISIT 2013: 1919-1923 - [c91]Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski:
Classification of Markov sources through joint string complexity: Theory and experiments. ISIT 2013: 2289-2293 - [c90]Lan V. Truong, Wojciech Szpankowski:
Capacity of a Structural Binary Symmetric Channel. ISIT 2013: 2478-2482 - [c89]Ralph Neininger, Kevin Leckey, Wojciech Szpankowski:
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. SODA 2013: 877-886 - [e2]Markus E. Nebel, Wojciech Szpankowski:
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. SIAM 2013, ISBN 978-1-61197-254-2 [contents] - 2012
- [j115]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet, the Father of Analytic Combinatorics. Algorithmica 62(1-2): 635-636 (2012) - [j114]Yongwook Choi, Charles Knessl, Wojciech Szpankowski:
On a Recurrence Arising in Graph Compression. Electron. J. Comb. 19(3): 15 (2012) - [j113]Yongwook Choi, Wojciech Szpankowski:
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments. IEEE Trans. Inf. Theory 58(2): 620-638 (2012) - [j112]Wojciech Szpankowski, Marcelo J. Weinberger:
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets. IEEE Trans. Inf. Theory 58(7): 4094-4104 (2012) - [j111]Philippe Jacquet, Charles Knessl, Wojciech Szpankowski:
Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Trans. Inf. Theory 58(7): 4261-4272 (2012) - [j110]Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger:
Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood. IEEE Trans. Inf. Theory 58(12): 7094-7109 (2012) - [c88]Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan:
Mutual information for a deletion channel. ISIT 2012: 2561-2565 - [c87]Jacek Cichon, Jakub Lemiesz, Wojciech Szpankowski, Marcin Zawada:
Two-phase cardinality estimation protocols for sensor networks with provable precision. WCNC 2012: 2009-2013 - [i5]Kevin Leckey, Ralph Neininger, Wojciech Szpankowski:
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. CoRR abs/1207.0302 (2012) - [i4]Neri Merhav, Wojciech Szpankowski:
Average redundancy of the Shannon code for Markov sources. CoRR abs/1208.1225 (2012) - 2011
- [j109]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet: the father of analytic combinatorics. ACM Commun. Comput. Algebra 45(1/2): 90-91 (2011) - [j108]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet 1 December 1948 - 22 March 2011. Comb. Probab. Comput. 20(5): 647-649 (2011) - [j107]Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet (1948-2011). Bull. EATCS 104: 16-18 (2011) - [j106]Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
In memoriam: Philippe Flajolet, the father of analytic combinatorics. RAIRO Theor. Informatics Appl. 45(4): 371-373 (2011) - [j105]Michael Drmota, Wojciech Szpankowski:
The expected profile of digital search trees. J. Comb. Theory A 118(7): 1939-1965 (2011) - [j104]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Obituary. Philippe Flajolet. J. Symb. Comput. 46(9): 1085-1086 (2011) - [j103]Yongwook Choi, Wojciech Szpankowski:
Constrained pattern matching. ACM Trans. Algorithms 7(2): 25:1-25:19 (2011) - [j102]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe flajolet, the father of analytic combinatorics. ACM Trans. Algorithms 7(4): 40:1-40:2 (2011) - [j101]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet, the Father of Analytic Combinatorics. Theor. Comput. Sci. 412(35): 4469-4470 (2011) - [j100]Wojciech Szpankowski, Sergio Verdú:
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints. IEEE Trans. Inf. Theory 57(7): 4017-4025 (2011) - [c86]Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger:
Deinterleaving Markov processes: The finite-memory switch case. ISIT 2011: 298-302 - [c85]Michael Drmota, Wojciech Szpankowski:
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. ISIT 2011: 1317-1321 - [c84]Philippe Jacquet, Wojciech Szpankowski:
Limiting distribution of Lempel Ziv'78 redundancy. ISIT 2011: 1509-1513 - [c83]Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. SODA 2011: 342-361 - [i3]Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger:
Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood. CoRR abs/1108.5212 (2011) - 2010
- [j99]Gopal Pandurangan, Wojciech Szpankowski:
A Universal Online Caching Algorithm Based on Pattern Matching. Algorithmica 57(1): 62-73 (2010) - [j98]Olgica Milenkovic, Gil Alterovitz, Gerard Battail, Todd P. Coleman, Joachim Hagenauer, Sean P. Meyn, Nathan D. Price, Marco Ramoni, Ilya Shmulevich, Wojciech Szpankowski:
Introduction to the special issue on information theory in molecular biology and neuroscience. IEEE Trans. Inf. Theory 56(2): 649-652 (2010) - [j97]Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski:
Tunstall code, Khodak variations, and random walks. IEEE Trans. Inf. Theory 56(6): 2928-2937 (2010) - [j96]Philippe Jacquet, Wojciech Szpankowski:
Noisy Constrained Capacity for BSC Channels. IEEE Trans. Inf. Theory 56(11): 5412-5423 (2010) - [c82]Wojciech Szpankowski, Marcelo J. Weinberger:
Minimax redundancy for large alphabets. ISIT 2010: 1488-1492
2000 – 2009
- 2009
- [j95]Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009) - [j94]GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski:
Profiles of Tries. SIAM J. Comput. 38(5): 1821-1880 (2009) - [c81]Yongwook Choi, Wojciech Szpankowski:
Compression of graphical structures. ISIT 2009: 364-368 - [c80]Wojciech Szpankowski, Sergio Verdú:
Minimum expected length of fixed-to-variable lossless compression of memoryless sources. ISIT 2009: 369-373 - [c79]John C. Kieffer, En-Hui Yang, Wojciech Szpankowski:
Structural complexity of random binary trees. ISIT 2009: 635-639 - [c78]Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski:
Deinterleaving Markov processes via penalized ML. ISIT 2009: 1739-1743 - [c77]Michael Drmota, Wojciech Szpankowski:
(Un)expected behavior of digital search tree profile. SODA 2009: 130-138 - 2008
- [j93]Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
On the entropy of a hidden Markov process. Theor. Comput. Sci. 395(2-3): 203-219 (2008) - [j92]Wojciech Szpankowski:
A One-to-One Code and Its Anti-Redundancy. IEEE Trans. Inf. Theory 54(10): 4762-4766 (2008) - [j91]Yann Bugeaud, Michael Drmota, Wojciech Szpankowski:
On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Trans. Inf. Theory 54(11): 5073-5086 (2008) - [c76]Yongwook Choi, Wojciech Szpankowski:
Large deviations for constrained pattern matching. ISIT 2008: 2141-2145 - [c75]Jerzy Konorski, Wojciech Szpankowski:
What is information? ITW 2008: 269-270 - [c74]GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski:
Profile of Tries. LATIN 2008: 1-11 - [c73]Jayesh Pandey, Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama:
Annotating Pathways of Interaction Networks. Pacific Symposium on Biocomputing 2008: 153-165 - [e1]Robert Sedgewick, Wojciech Szpankowski:
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008, ISBN 978-1-61197-298-6 [contents] - 2007
- [j90]Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski:
Randomized leader election. Distributed Comput. 19(5-6): 403-418 (2007) - [j89]Valery T. Stefanov, Wojciech Szpankowski:
Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j88]Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski:
Identifying Statistical Dependence in Genomic Sequences via Mutual Information Estimates. EURASIP J. Bioinform. Syst. Biol. 2007 (2007) - [j87]Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama:
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. J. Comput. Biol. 14(6): 747-764 (2007) - [j86]Svante Janson, Wojciech Szpankowski:
Partial fillup and search time in LC tries. ACM Trans. Algorithms 3(4): 44 (2007) - [j85]Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments. IEEE Trans. Inf. Theory 53(5): 1799-1813 (2007) - [c72]Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
Noisy Constrained Capacity. ISIT 2007: 986-990 - [c71]Yongwook Choi, Wojciech Szpankowski:
Pattern Matching in Constrained Sequences. ISIT 2007: 2606-2610 - [c70]Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Y. Grama, Wojciech Szpankowski:
Statistical Dependence in Biological Sequences. ISIT 2007: 2676-2680 - [c69]Jayesh Pandey, Mehmet Koyutürk, Yohan Kim, Wojciech Szpankowski, Shankar Subramaniam, Ananth Grama:
Functional annotation of regulatory pathways. ISMB/ECCB (Supplement of Bioinformatics) 2007: 377-386 - [c68]Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables. SODA 2007: 891-899 - [i2]Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski:
Identifying statistical dependence in genomic sequences via mutual information estimates. CoRR abs/0710.5190 (2007) - 2006
- [j84]Philippe Jacquet, Daniel Panario, Wojciech Szpankowski:
Preface. Algorithmica 46(3-4): 247-248 (2006) - [j83]Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée:
Hidden word statistics. J. ACM 53(1): 147-183 (2006) - [j82]Mehmet Koyutürk, Yohan Kim, Umut Topkara, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama:
Pairwise Alignment of Protein Interaction Networks. J. Comput. Biol. 13(2): 182-199 (2006) - [j81]Mehmet Koyutürk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama:
Detecting Conserved Interaction Patterns in Biological Networks. J. Comput. Biol. 13(7): 1299-1322 (2006) - [j80]Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang:
Finding biclusters by random projections. Theor. Comput. Sci. 368(3): 217-230 (2006) - [j79]Cédric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski:
Multicast tree structure and the power law. IEEE Trans. Inf. Theory 52(4): 1508-1521 (2006) - [c67]Charles Knessl, Wojciech Szpankowski:
Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. ANALCO 2006: 198-204 - [c66]Svante Janson, Wojciech Szpankowski:
Partial Fillup and Search Time in LC Tries. ANALCO 2006: 223-229 - [c65]Yonghui Wu, Stefano Lonardi, Wojciech Szpankowski:
Error-Resilient LZW Data Compression. DCC 2006: 193-202 - [c64]Philippe Jacquet, Wojciech Szpankowski:
On (d, k) Sequences Not Containing a Given Word. ISIT 2006: 1486-1489 - [c63]Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski:
Precise Asymptotic Analysis of the Tunstall Code. ISIT 2006: 2334-2337 - [c62]Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski:
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB 2006: 45-59 - 2005
- [j78]Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees and Universal Types. Discret. Math. Theor. Comput. Sci. 7(1): 313-400 (2005) - [j77]Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski:
An optimal DNA segmentation based on the MDL principle. Int. J. Bioinform. Res. Appl. 1(1): 3-17 (2005) - [j76]Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski:
Reliable detection of episodes in event sequences. Knowl. Inf. Syst. 7(4): 415-437 (2005) - [j75]Luc Devroye, Wojciech Szpankowski:
Probabilistic behavior of asymmetric level compressed tries. Random Struct. Algorithms 27(2): 185-200 (2005) - [c61]Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO 2005: 222-229 - [c60]Gopal Pandurangan, Wojciech Szpankowski:
A universal online caching algorithm based on pattern matching. ISIT 2005: 1151-1155 - [c59]Wojciech Szpankowski:
One-to-one code and its anti-redundancy. ISIT 2005: 1526-1528 - [c58]Wojciech Szpankowski:
Analytic algorithmics, combinatorics, and information theory. ITW 2005: 216 - [c57]Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski:
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution. RECOMB 2005: 48-65 - [c56]Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski:
Markov Models for Identification of Significant Episodes. SDM 2005: 404-414 - [c55]GaHyun Park, Wojciech Szpankowski:
Towards a complete characterization of tries. SODA 2005: 33-42 - [i1]Svante Janson, Wojciech Szpankowski:
Partial fillup and search time in LC tries. CoRR abs/cs/0510017 (2005) - 2004
- [j74]Michael Drmota, Wojciech Szpankowski:
Special Issue on Analysis of Algorithms. Comb. Probab. Comput. 13(4-5): 415-417 (2004) - [j73]Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004) - [j72]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On average sequence complexity. Theor. Comput. Sci. 326(1-3): 213-227 (2004) - [j71]John C. Kieffer, Wojciech Szpankowski, En-Hui Yang:
Problems on Sequences: Information Theory and Computer Science Interface. IEEE Trans. Inf. Theory 50(7): 1385-1392 (2004) - [j70]Philippe Jacquet, Wojciech Szpankowski:
Markov types and minimax redundancy for Markov sources. IEEE Trans. Inf. Theory 50(7): 1393-1402 (2004) - [j69]Michael Drmota, Wojciech Szpankowski:
Precise minimax redundancy and regret. IEEE Trans. Inf. Theory 50(11): 2686-2707 (2004) - [c54]Mark Daniel Ward, Wojciech Szpankowski:
Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. ALENEX/ANALC 2004: 153-160 - [c53]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On the Average Sequence Complexity. CPM 2004: 74-88 - [c52]Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang:
Finding Biclusters by Random Projections. CPM 2004: 102-116 - [c51]Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama:
Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB 2004: 480-484 - [c50]Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
On the Entropy of a Hidden Markov Process. Data Compression Conference 2004: 362-371 - [c49]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On the Average Sequence Complexity. Data Compression Conference 2004: 542 - [c48]Mikhail J. Atallah, Robert Gwadera, Wojciech Szpankowski:
Detection of Significant Sets of Episodes in Event Sequences. ICDM 2004: 3-10 - [c47]Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
On the entropy of a Hidden Markov process. ISIT 2004: 10 - [c46]Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
Error resilient LZ'77 scheme and its analysis. ISIT 2004: 56 - [c45]Michael Drmota, Wojciech Szpankowski:
Variable-to-variable codes with small redundancy rates. ISIT 2004: 91 - [c44]Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski:
An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB/ECCB (Supplement of Bioinformatics) 2004: 200-207 - 2003
- [j68]Michael Drmota, Wojciech Szpankowski:
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bull. EATCS 80: 61-76 (2003) - [c43]Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski:
An Optimal DNA Segmentation Based on the MDL Principle. CSB 2003: 541-546 - [c42]Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski:
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003: 575-580 - [c41]Stefano Lonardi, Wojciech Szpankowski:
Joint Source-Channel LZ'77 Coding. DCC 2003: 273-282 - [c40]Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski:
Reliable Detection of Episodes in Event Sequences. ICDM 2003: 67-74 - 2002
- [j67]Charles Knessl, Wojciech Szpankowski:
Limit laws for the height in PATRICIA tries. J. Algorithms 44(1): 63-97 (2002) - [j66]Charles Knessl, Wojciech Szpankowski:
The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. 289(1): 649-703 (2002) - [j65]Marc Alzina, Wojciech Szpankowski, Ananth Grama:
2D-pattern matching image and video compression: theory, algorithms, and experiments. IEEE Trans. Image Process. 11(3): 318-331 (2002) - [j64]Philippe Jacquet, Wojciech Szpankowski, Izydor Apostol:
A universal predictor based on pattern matching. IEEE Trans. Inf. Theory 48(6): 1462-1472 (2002) - [j63]Helmut Prodinger, Wojciech Szpankowski:
Optimal versus randomized search of fixed length binary words. IEEE Trans. Inf. Theory 48(9): 2614-2621 (2002) - [j62]Philippe Flajolet, Wojciech Szpankowski:
Analytic variations on redundancy rates of renewal processes. IEEE Trans. Inf. Theory 48(11): 2911-2921 (2002) - [c39]Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski:
Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC 2002: 222- - [c38]Yuriy A. Reznik, Wojciech Szpankowski:
Improved Behaviour of Tries by the "Symmetrization" of the Source. DCC 2002: 372- - [c37]Sacha Zyto, Ananth Grama, Wojciech Szpankowski:
Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002: 484 - [c36]Michael Drmota, Wojciech Szpankowski:
Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN 2002: 306-318 - [c35]Cédric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski:
Is the internet fractal? SODA 2002: 338-345 - 2001
- [j61]Helmut Prodinger, Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001) - [j60]Philippe Jacquet, Wojciech Szpankowski, Jing Tang:
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. Algorithmica 31(3): 318-360 (2001) - [j59]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) - [c34]Ananth Grama, David Meyer, Wojciech Szpankowski:
Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001: 496 - [c33]Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée:
Hidden Pattern Statistics. ICALP 2001: 152-165 - 2000
- [j58]Charles Knessl, Wojciech Szpankowski:
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electron. J. Comb. 7 (2000) - [j57]Charles Knessl, Wojciech Szpankowski:
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. SIAM J. Comput. 30(3): 923-964 (2000) - [j56]Wojciech Szpankowski:
Asymptotic average redundancy of Huffman (and other) block codes. IEEE Trans. Inf. Theory 46(7): 2434-2443 (2000) - [c32]Yuriy A. Reznik, Wojciech Szpankowski:
On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol. Data Compression Conference 2000: 373-382 - [c31]Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski:
Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference 2000: 420-429 - [c30]Charles Knessl, Wojciech Szpankowski:
Heights in Generalized Tries and PATRICIA Tries. LATIN 2000: 298-307 - [c29]Charles Knessl, Wojciech Szpankowski:
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA 2000: 187-196
1990 – 1999
- 1999
- [j55]Charles Knessl, Wojciech Szpankowski:
Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. 3(2): 43-64 (1999) - [j54]Izydor Apostol, Wojciech Szpankowski:
Indexing and mapping of proteins using a modified nonlinear Sammon projection. J. Comput. Chem. 20(10): 1049-1059 (1999) - [j53]Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski:
Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 614-627 (1999) - [j52]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) - [j51]Philippe Jacquet, Wojciech Szpankowski:
Entropy Computations via Analytic Depoissonization. IEEE Trans. Inf. Theory 45(4): 1072-1081 (1999) - [c28]Marc Alzina, Wojciech Szpankowski, Ananth Grama:
2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999: 424-433 - [p1]Wojciech Szpankowski:
Average Case Analysis of Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j50]Alan M. Frieze, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica 21(1): 21-36 (1998) - [j49]Helmut Prodinger, Wojciech Szpankowski:
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica 22(4): 366-387 (1998) - [j48]Mireille Régnier, Wojciech Szpankowski:
On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica 22(4): 631-649 (1998) - [j47]Philippe Jacquet, Wojciech Szpankowski:
Analytical Depoissonization and its Applications. Theor. Comput. Sci. 201(1-2): 1-62 (1998) - [c27]Mireille Régnier, Wojciech Szpankowski:
Complexity of Sequential Pattern Matching Algorithms. RANDOM 1998: 187-199 - [c26]Charles Knessl, Wojciech Szpankowski:
Quicksort Again Revisited. RANDOM 1998: 345-356 - 1997
- [j46]Svante Janson, Wojciech Szpankowski:
Analysis of an Asymmetric Leader Election Algorithm. Electron. J. Comb. 4(1) (1997) - [j45]Philippe Flajolet, Wojciech Szpankowski:
Analysis of algorithms. Random Struct. Algorithms 10(1-2): 1-3 (1997) - [j44]Guy Louchard, Wojciech Szpankowski:
On the average redundancy rate of the Lempel-Ziv code. IEEE Trans. Inf. Theory 43(1): 2-8 (1997) - [j43]Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas:
Stability analysis of quota allocation access protocols in ring networks with spatial reuse. IEEE Trans. Inf. Theory 43(3): 923-937 (1997) - [j42]Tomasz Luczak, Wojciech Szpankowski:
A suboptimal lossy data compression based on approximate pattern matching. IEEE Trans. Inf. Theory 43(5): 1439-1451 (1997) - [j41]Tomasz Luczak, Wojciech Szpankowski:
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. IEEE Trans. Inf. Theory 43(6): 2064-2065 (1997) - [c25]Mireille Régnier, Wojciech Szpankowski:
On the approximate pattern occurrences in a text. SEQUENCES 1997: 253-264 - 1996
- [j40]Ioannis Fudos, Evaggelia Pitoura, Wojciech Szpankowski:
On Pattern Occurrences in a Random Text. Inf. Process. Lett. 57(6): 307-312 (1996) - [j39]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) - [c24]Guy Louchard, Wojciech Szpankowski:
On the Average Redundancy Rate of the Lempel-Ziv Code. Data Compression Conference 1996: 92-101 - [c23]Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski:
Pattern Matching Image Compression. Data Compression Conference 1996: 421 - [c22]Alan M. Frieze, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA 1996: 194-207 - [c21]Mikhail J. Atallah, Wojciech Szpankowski, Yann Génin:
A pattern matching approach to image compression. ICIP (2) 1996: 349-352 - 1995
- [j38]Guy Louchard, Wojciech Szpankowski:
A probabilistic Analysis of a String Editing Problem and its Variations. Comb. Probab. Comput. 4: 143-166 (1995) - [j37]Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas:
A scheduling policy with maximal stability region for ring networks with spatial reuse. Queueing Syst. Theory Appl. 19(1-2): 131-148 (1995) - [j36]Philippe Jacquet, Wojciech Szpankowski:
Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theor. Comput. Sci. 144(1&2): 161-197 (1995) - [j35]Guy Louchard, Wojciech Szpankowski:
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Trans. Inf. Theory 41(2): 478-488 (1995) - [j34]Wojciech Szpankowski:
On asymptotics of certain sums arising in coding theory. IEEE Trans. Inf. Theory 41(6): 2087-2090 (1995) - [c20]Guy Louchard, Wojciech Szpankowski:
Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile. Data Compression Conference 1995: 262-271 - 1994
- [j33]Philippe Jacquet, Wojciech Szpankowski:
Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach. J. Comb. Theory A 66(2): 237-269 (1994) - [j32]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994) - [c19]Tomasz Luczak, Wojciech Szpankowski:
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. CPM 1994: 102-112 - [c18]Philippe Jacquet, Wojciech Szpankowski:
A functional equation often arising in the analysis of algorithms (extended abstract). STOC 1994: 780-789 - 1993
- [j31]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) - [j30]Helmut Prodinger, Wojciech Szpankowski:
A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. 46(6): 309-311 (1993) - [j29]Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski:
A Probabilistic Analysis of a Pattern Matching Problem. Random Struct. Algorithms 4(2): 191-214 (1993) - [j28]Wojciech Szpankowski:
A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors. SIAM J. Comput. 22(6): 1176-1198 (1993) - [j27]Bonita Rais, Philippe Jacquet, Wojciech Szpankowski:
Limiting Distribution for the Depth in Patricia Tries. SIAM J. Discret. Math. 6(2): 197-213 (1993) - [j26]Wojciech Szpankowski:
Asymptotic properties of data compression and suffix trees. IEEE Trans. Inf. Theory 39(5): 1647-1659 (1993) - [c17]Guy Louchard, Wojciech Szpankowski:
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993: 152-163 - 1992
- [j25]Alberto Apostolico, Wojciech Szpankowski:
Self-Alignments in Words and Their Applications. J. Algorithms 13(3): 446-467 (1992) - [j24]Leonidas Georgiadis, Wojciech Szpankowski:
Stability of token passing rings. Queueing Syst. Theory Appl. 11(1-2): 7-33 (1992) - [j23]Luc Devroye, Wojciech Szpankowski, Bonita Rais:
A Note on the Height of Suffix Trees. SIAM J. Comput. 21(1): 48-53 (1992) - [j22]David J. 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) - [j21]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) - [c16]Wojciech Szpankowski:
Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract). CPM 1992: 1-14 - [c15]Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski:
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM 1992: 27-40 - [c14]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. ICALP 1992: 211-222 - [c13]Wojciech Szpankowski:
(Un)expected Behavior of Typical Suffix Trees. SODA 1992: 422-431 - 1991
- [j20]Wojciech Szpankowski:
On the Height of Digital Trees and Related Problems. Algorithmica 6(2): 256-277 (1991) - [j19]Wojciech Szpankowski:
A Characterization of Digital Search Trees from the Successful Search Viewpoint. Theor. Comput. Sci. 85(1): 117-134 (1991) - [j18]Philippe Jacquet, Wojciech Szpankowski:
Analysis of digital tries with Markovian dependency. IEEE Trans. Inf. Theory 37(5): 1470-1475 (1991) - [c12]Wojciech Szpankowski:
A Typical Behaviour of Some Data Compression Schemes. Data Compression Conference 1991: 247-256 - [c11]Wojciech Szpankowski:
Combinatorial Optimization Through Order Statistics. ISA 1991: 208-217 - [c10]Philippe Jacquet, Wojciech Szpankowski:
What Can We Learn about Suffix Trees from Independent Tries? WADS 1991: 228-239 - 1990
- [j17]Wojciech Szpankowski, Vernon Rego:
Yet another application of a binomial recurrence order statistics. Computing 43(4): 401-410 (1990) - [j16]Wojciech Szpankowski:
Patricia Tries Again Revisited. J. ACM 37(4): 691-711 (1990) - [c9]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
1980 – 1989
- 1989
- [j15]Wojciech Szpankowski:
Some remarks on uniformly bounded markov chains: multimodality analysis. Comput. Oper. Res. 16(2): 85-99 (1989) - [j14]Vernon Rego, Wojciech Szpankowski:
The presence of exponentiality in entropy maximized M/GI/1 queues. Comput. Oper. Res. 16(5): 441-449 (1989) - [j13]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie. Discret. Appl. Math. 25(1-2): 129-143 (1989) - [j12]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) - [j11]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) - [c8]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Digital Search Trees - Further Results on a Fundamental Data Structure. IFIP Congress 1989: 443-447 - [c7]Wojciech Szpankowski:
Digital Data Structures and Order Statistics. WADS 1989: 206-217 - 1988
- [j10]Vernon Rego, Wojciech Szpankowski:
Closed-network duals of multiqueues with application to token-passing systems. Comput. Syst. Sci. Eng. 3(3): 127-139 (1988) - [j9]Wojciech Szpankowski:
Stability Conditions for Multidimensional Queueing Systems with Computer Applications. Oper. Res. 36(6): 944-957 (1988) - [j8]Wojciech Szpankowski, Vernon Rego:
Some Theorems on Instability with Applications to Multiaccess Protocols. Oper. Res. 36(6): 958-966 (1988) - [j7]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) - [j6]Wojciech Szpankowski:
Some Results on V-ary Asymmetric Tries. J. Algorithms 9(2): 224-244 (1988) - [c6]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP 1988: 302-316 - [c5]Wojciech Szpankowski:
On an Alternative Sum Useful in the Analysis of Some Data Structures. SWAT 1988: 120-128 - 1987
- [j5]Wojciech Szpankowski:
An Analysis of a Contention Resolution Algorithm: Another Approach. Acta Informatica 24(2): 173-190 (1987) - [c4]Wojciech Szpankowski:
Two Problems on the Average Complexity of Digital Trees. Performance 1987: 189-208 - [c3]Dan C. Marinescu, Vernon Rego, Wojciech Szpankowski:
Modeling of an availability driven computer network architecture. Simulation of Computer Networks 1987: 2-10 - [c2]Wojciech Szpankowski:
Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). TAPSOFT, Vol.1 1987: 13-25 - 1986
- [j4]Wojciech Szpankowski:
On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. Inf. Process. Lett. 23(3): 135-142 (1986) - [j3]Wojciech Szpankowski:
Bounds for Queue Lengths in a Contention Packet Broadcast System. IEEE Trans. Commun. 34(11): 1132-1140 (1986) - 1983
- [j2]Wojciech Szpankowski:
Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System. Comput. Networks 7: 17-26 (1983) - [j1]Wojciech Szpankowski:
Analysis and Stability Considerations in a Reservation Multiaccess System. IEEE Trans. Commun. 31(5): 684-692 (1983) - [c1]Wojciech Szpankowski:
Performance Evaluation of a Reservation Protocol for Multiaccess Systems. Performance 1983: 377-394
Coauthor Index
Ananth Grama
aka: Ananth Y. Grama
aka: Ananth Y. Grama
Abram Magner
aka: Abram N. Magner
aka: Abram N. Magner
Jithin Kazuthuveettil Sreedharan
aka: Jithin K. Sreedharan
aka: Jithin K. Sreedharan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
